Abstract
This paper describes two approaches based on evolutionary algorithms for determining Bayesian networks structures from a database of cases. One major difficulty when tackling the problem of structure learning with evolutionary strategies is to avoid the premature convergence of the population to a local optimum.
In this paper, we propose two methods in order to overcome this obstacle.
The first method is a hybridization of a genetic algorithm with a tabu search principle whilst the second method consists in the application of a dynamic mutation rate. For both methods, a repair operator based on the mutual information between the variables was defined to ensure the closeness of the genetic operators. Finally, we evaluate the influence of our methods over the search for known networks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chickering, D.M., Geiger, D., Heckerman, D.: Learning Bayesian Networks is NP-hard. Technical Report MSR-TR-94-17, Microsoft Research (November 1994)
Cooper, G., Herskovits, E.: A Bayesian method for the Induction of Probabilistic Networks from Data. Machine Learning 09, 309–347 (1992)
Robinson, R.: Counting Unlabeled Acyclic Digraphs. In: Combinatorial Mathematics V: Proceedings of the Fifth Australian Conference, held at the Royal Melbourne Institute of Technology. American Mathematical Society, pp. 28–43 (1976)
Friedman, N.: The Bayesian Structural EM Algorithm. In: Fourteenth Conference on Uncertainty in Artificial Intelligence (UAI), pp. 129–138 (1998)
Chickering, D.M.: Optimal Structure Identification with Greedy Search. Journal of Machine Learning Research 3, 507–554 (2002)
Spirtes, P., Glymour, C., Scheines, R.: Causation, Prediction and Search. Springer, Heidelberg (1993)
Cheng, J., Bell, D., Liu, W.: Learning Belief Networks from Data: an Information Theory Based Approach. In: Proceedings of the sixth ACM International Conference on Information and Knowledge Management, pp. 325–331. ACM Press, New York (1997)
Larranaga, P., Poza, M., Yurramendi, Y., Murga, R., Kuijpers, C.: Structure Learning of Bayesian Networks by Genetic Algorithms: A Performance Analysis of Control Parameters. IEEE Trans (PAMI) 18(9), 912–926 (1996)
Cotta, C., Muruzábal, J.: On the Learning of Bayesian Network Graph Structures via Evolutionary Programming. In: Proceedings of the 2nd European Workshop on Probabilistic Graphical Models, pp. 65–72 (2004)
Wong, M., Lam, W., Leung, K.: Using Pvolutionary Programming and Minimum Description Length Principle for Data Mining of Bayesian networks. IEEE Trans (PAMI) 21(2), 174–178 (1999)
Wong, M., Lee, S.Y., Leung,K.S.: A Hybrid Data Mining Approach To Discover Bayesian Networks Using Evolutionary Programming. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002), pp. 214–222 (2002)
van Dijk, S., Thierens, D., van der Gaag, L.C.: A Skeleton-Based Approach to Learning Bayesian Networks from Data. In: 7th European Conference on Principles and Practice of Knowledge Discovery in Databases, Cavtat-Dubrovnik, Croatia, September 22-26, 2003, pp. 132–143 (2003)
van Dijk, S., Thierens, D., van der Gaag, L.C.: Building a GA from Design Principles for Learning Bayesian Networks. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2003) pp. 886–897 (2003)
Verma, T., Pearl, J.: Equivalence and Synthesis of Causal Models. In: Proceedings of the Sixth Conference on Uncertainty and Artificial Intelligence, pp. 220–227. Morgan Kaufmann, San Francisco (1990)
Silvia Acid, S., de Campos, L.M.: Searching for Bayesian Network Structures in the Space of Restricted Acyclic Partially Directed Graphs. Journal of Artificial Intelligence Research 18, 445–490 (2003)
Holland, J.H.: Adaptation in natural and artificial systems. The University of Michigan Press, Ann Arbor (1975)
Heckerman, D.: A Tutorial on Learning Bayesian Networks. Technical Report MSR-TR-95-06, Microsoft Research (March (1995)
Chow, C.K., Liu, C.N.: Approximating Discrete Probability Distributions with Dependence Trees. IEEE Trans. on Information Theory 14(3), 462–467 (1968)
Chickering, D.M.: Learning equivalence classes of Bayesian-network structures. Journal of Machine Learning Research 2, 445–498 (2002)
Eiben, A.E., Hinterding, R., Michalewicz, Z.: Parameter Control in Evolutionary Algorithms. IEEE Trans. on Evolutionary Computation 3(2), 124–141 (1999)
Glickman, M., Sycara, K.: Reasons for Premature Convergence of Self-adapting Mutation Rates. In: Proceedings of the 2000 Congress on Evolutionary Computation, Vol. 1, pp. 62–69 (July 2000)
Thierens, D.: Adaptive mutation Rate Control Schemes in Genetic Algorithms. In: Technical Report UU-CS-2002-056, Institute of Information and Computing Sciences, Utrecht University (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Delaplace, A., Brouard, T., Cardot, H. (2007). Two Evolutionary Methods for Learning Bayesian Network Structures. In: Wang, Y., Cheung, Ym., Liu, H. (eds) Computational Intelligence and Security. CIS 2006. Lecture Notes in Computer Science(), vol 4456. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74377-4_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-74377-4_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74376-7
Online ISBN: 978-3-540-74377-4
eBook Packages: Computer ScienceComputer Science (R0)