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 setsNodesSample sizesTnsDFSDPCBDPBFSDP

monks_T7432192.41930.45700.7090
Car71728272.67331.51680.8333
Diabetes9768113731.78746.5755334.7031
Abalone94177245OMOMOM
Nursery9129603551.0125.6808.1019
Contracep10147346227.25122.815012.0520
Wine14178952.45e + 0052.068e + 005169.1900
Heart14270822.45e + 0051.190e + 005225.0510
Australian15690108OTOT1.06e + 003
Zoo1710142OTOT8.2036e + 003
pen_A177494170OMOMOM
letter_A1715000282OMOMOM
Segment202310427OMOMOM
German251000148OMOMOM