“Fast
fitness improvements in Estimation of Distribution Algorithms using belief
propagation”
by
A. Mendiburu,
R. Santana,
and
J. A. Lozano.
In *Markov Networks in Evolutionary Computation*, (R. Santana and S. Shakya, eds.), 2012, pp. 141-155.

Factor graphs can serve to represent Markov networks and Bayesian networks models. They can also be employed to implement efficient inference procedures such as belief propagation. In this paper we introduce a flexible implementation of belief propagation on factor graphs in the context of estimation of distribution algorithms (EDAs). By using a transformation from Bayesian networks to factor graphs, we show the way in which belief propagation can be inserted within the Estimation of Bayesian Networks Algorithm (EBNA). The objective of the proposed variation is to increase the search capabilities by extracting information of the, computationally costly to learn, Bayesian network. Belief Propagation applied to graphs with cycles allows to find (with a low computational cost), in many scenarios, the point with the highest probability of a Bayesian network. We carry out some experiments to show how this modification can increase the potentialities of Estimation of Distribution Algorithms.

**BibTeX entry:**

@incollection{Mendiburu_et_al:2012, author = {A. Mendiburu and R. Santana and J. A. Lozano}, editor = {R. Santana and S. Shakya}, title = {Fast fitness improvements in Estimation of Distribution Algorithms using belief propagation}, booktitle = {Markov Networks in Evolutionary Computation}, pages = {141-155}, publisher = {Springer}, year = {2012}, url = {http://dx.doi.org/10.1007/978-3-642-28900-2_9} }

(This webpage was created with bibtex2web.)

Back to Roberto Santana publications.