A Method of Handling Missing Data in the Context of Learning Bayesian Network Structure

Article Preview

Abstract:

Under the background of learning Bayesian network structure, we proposed a new method based on the KNN algorithm and dynamic Gibbs sampling to fill in the missing data, which is mainly used to solve the problem of how to learn the Bayesian network structure better with missing data sets. The experiments based on Asia Network show that, this method can restore the original data very well, which will make it available to use some Bayesian network structure learning algorithm only based on complete data. This method will expand the scope and improve the effect of Bayesian networks application.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

906-910

Citation:

Online since:

December 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] HECKERMAN D, BREESE J. Causal independence for probability assessment and inference using Bayesian networks [J]. IEEE Transactions on Systems, Man, and Cybernetics, 1996, 26(6): 826-831.

DOI: 10.1109/3468.541341

Google Scholar

[2] FRIEDMAN N. Learning belief networks in the presence of missing values and hidden variables[C]. In: Proceedings of the 14th National Conference on Machine Learning, San Francisco: Morgan Kaufmann Publisher, 1997, 125-133.

Google Scholar

[3] FRIEDMAN N. The Bayesian structural EM algorithm[C]. In: Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, San Francisco, 1998, 129-138.

Google Scholar

[4] P. Leray and O. François. Bayesian Network Structural Learning and Incomplete Data. In Proceedings of the International and Interdisciplinary Conference on Adap-tive Knowledge Representation and Reasoning (AKRR 2005), Espoo, Finland, pages 33–40, (2005).

Google Scholar

[5] H. Borchani, N. Ben Amor, and K. Mellouli. Learning bayesian network equivalence classes from incomplete data. Lecture Notes in Computer Science, 4265/2006: 291–295, (2006).

DOI: 10.1007/11893318_29

Google Scholar

[6] Kuncheva L. I. Editing for the k-nearest neighbors rule by a genetic algorithm [J]. Pattern Recognition Letters, 1995, (16): 809-814.

DOI: 10.1016/0167-8655(95)00047-k

Google Scholar

[7] S.L. Lauritzen and D.J. Spiegelhalter. Local computations with probabilities on graph-ical structures and their application to expert systems. Journal of the Royal Statis-tical Society B, 50(2): 157–224, (1988).

DOI: 10.1111/j.2517-6161.1988.tb01721.x

Google Scholar