Research Article
Research on Dynamic Programming Strategy of Bayesian Network Structure Learning
Table 6
Time-consuming comparison between three algorithms under UCI data sets (s).
| Data sets | Nodes | Sample sizes | Tns | DFSDP | CBDP | BFSDP |
| monks_T | 7 | 432 | 19 | 2.4193 | 0.4570 | 0.7090 | Car | 7 | 1728 | 27 | 2.6733 | 1.5168 | 0.8333 | Diabetes | 9 | 768 | 113 | 731.78 | 746.5755 | 334.7031 | Abalone | 9 | 4177 | 245 | OM | OM | OM | Nursery | 9 | 12960 | 35 | 51.01 | 25.680 | 8.1019 | Contracep | 10 | 1473 | 46 | 227.25 | 122.8150 | 12.0520 | Wine | 14 | 178 | 95 | 2.45e + 005 | 2.068e + 005 | 169.1900 | Heart | 14 | 270 | 82 | 2.45e + 005 | 1.190e + 005 | 225.0510 | Australian | 15 | 690 | 108 | OT | OT | 1.06e + 003 | Zoo | 17 | 101 | 42 | OT | OT | 8.2036e + 003 | pen_A | 17 | 7494 | 170 | OM | OM | OM | letter_A | 17 | 15000 | 282 | OM | OM | OM | Segment | 20 | 2310 | 427 | OM | OM | OM | German | 25 | 1000 | 148 | OM | OM | OM |
|
|