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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Delaplace, A., Brouard, T., & Cardot, H. (2007). Two evolutionary methods for learning bayesian network structures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4456 LNAI, pp. 288–297). Springer Verlag. https://doi.org/10.1007/978-3-540-74377-4_31
Mendeley helps you to discover research relevant for your work.