论文信息 - Hybrid algorithm for learning structure of Bayesian network from incomplete databases

Hybrid algorithm for learning structure of Bayesian network from incomplete databases

Scoring-based and constraint-based algorithms are two approaches for learning BN structure from data. Hybrid algorithm combines these two approaches in order being more efficient. Experimental result shows its superior. The algorithm, then, is modified to overcome incomplete databases. It is expected that the proposed algorithm can also show its superiority.

B. Sitohang | G.A.P. Saptawati

[1] Jie Cheng,et al. Learning Bayesian Networks from Data: An Efficient Approach Based on Information Theory , 1999 .

[2] Richard E. Neapolitan,et al. Learning Bayesian networks , 2007, KDD '07.

[3] Nir Friedman,et al. Learning Bayesian Networks from Data , 2001 .

[4] Finn V. Jensen,et al. Bayesian Networks and Decision Graphs , 2001, Statistics for Engineering and Information Science.

[5] David Maxwell Chickering,et al. Learning Bayesian Networks: The Combination of Knowledge and Statistical Data , 1994, Machine Learning.

[6] Moninder Singh,et al. Construction of Bayesian network structures from data: A brief survey and an efficient algorithm , 1995, Int. J. Approx. Reason..

[7] Petra Perner,et al. Data Mining - Concepts and Techniques , 2002, Künstliche Intell..

[8] Paola Sebastiani,et al. Learning Bayesian Networks from Incomplete Databases , 1997, UAI.

[9] Yang Xiang,et al. Inference in multiply sectioned Bayesian networks: methods and performance comparison , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[10] Richard E. Korf,et al. Learning bayesian networks from data , 1996 .

[11] Nir Friedman,et al. Bayesian Network Classification with Continuous Attributes: Getting the Best of Both Discretization and Parametric Fitting , 1998, ICML.

[12] Michael G. Madden. A New Bayesian Network Structure for Classification Tasks , 2002, AICS.