Abstract
This paper describes a new data mining algorithm to learn Bayesian networks structures from incomplete data based on extended Evolutionary programming (EP) method and the Minimum Description Length (MDL) principle. This problem is characterized by a huge solution space with a highly multimodal landscape. The algorithm presents fitness function based on expectation, which converts incomplete data to complete data utilizing current best structure of evolutionary process. The algorithm adopts a strategy to alleviate the undulate phenomenon. Aiming at preventing and overcoming premature convergence, the algorithm combines the niche technology into the selection mechanism of EP. In addition, our algorithm, like some previous work, does not need to have a complete variable ordering as input. The experimental results illustrate that our algorithm can learn a good structure from incomplete data.
An erratum to this chapter can be found at http://dx.doi.org/10.1007/11550907_163 .
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Suzuki, J.: A construction of Bayesian networks from databases based on a MDL scheme. In: Proc. of the 9th Confon Uncertainty in Artificial Intelligence, pp. 266–273. Morgan Kaufmann, San Mateo (1993)
Xiang, Y., Wong, S.K.M.: Learning conditional independence relations from a probabilistic model, Department of Computer Science, University of Regina, CA, Tech. Rep: CS-94-03 (1994)
Heckerman, D.: Learning Bayesian network: The combination of knowledge and statistic data. Machine Learning 20(2), 197–243 (1995)
Cheng, J., Greiner, R., Kelly, J.: Learning Bayesian networks from data: An efficient algorithm based on information theory. Artificial Intelligence 137(1-2), 43–90 (2002)
Lam, W., Bacchus, F.: Learning Bayesian belief networks: An algorithm based on the MDL principle. Computational Intelligence, 10(4) (1994)
Larranaga, P., Poza, M., Yurramendi, Y., Murga, R., Kuijpers, C.: Structure Learning of Bayesian Network by Genetic Algorithms: A Performance Analysis of Control Parameters. IEEE Trans. Pattern Analysis and Machine Intelligence
Friedman, N.: The Bayesian Structural EM Algorithm. In: Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence. Morgan Kaufmann Publishers, Madison (1998a)
Mahfound, S.W.: Crowding and Preselection Revisited. Parallel Problem Solving from Nature II, 27–36 (1992)
Lam, W., Bacchus, F.: Learning Bayesian belief networks: an algorithm based on the MDL principle. Computational Intelligence 10(4), 269–293 (1994)
Friedman, N.: Learning Belief Networks in the Presence of Missing Values and Hidden Variables. In: Fourteenth International Conference on Machine Learning (ICML 1997), Vanderbilt University. Morgan Kaufmann Publishers, San Francisco (1998b)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, X., He, X., Yuan, S. (2005). A New Method of Learning Bayesian Networks Structures from Incomplete Data. In: Duch, W., Kacprzyk, J., Oja, E., Zadrożny, S. (eds) Artificial Neural Networks: Formal Models and Their Applications – ICANN 2005. ICANN 2005. Lecture Notes in Computer Science, vol 3697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11550907_41
Download citation
DOI: https://doi.org/10.1007/11550907_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28755-1
Online ISBN: 978-3-540-28756-8
eBook Packages: Computer ScienceComputer Science (R0)