A review on probabilistic graphical models in evolutionary computation

A review on probabilistic graphical models in evolutionary computation” by P. Larrañaga, H. Karshenas, C. Bielza, and R. Santana. Journal of Heuristics, vol. 18, no. 5, 2012, pp. 795-819.


Thanks to their inherent properties, probabilistic graphical models are one of the prime candidates for machine learning and decision making tasks especially in uncertain domains. Their capabilities, like representation, inference and learning, if used effectively, can greatly help to build intelligent systems that are able to act accordingly in different problem domains. Evolutionary algorithms is one such discipline that has employed probabilistic graphical models to improve the search for optimal solutions in complex problems. This paper shows how probabilistic graphical models have been used in evolutionary algorithms to improve their performance in solving complex problems. Specifically, we give a survey of probabilistic model building-based evolutionary algorithms, called estimation of distribution algorithms, and compare different methods for probabilistic modeling in these algorithms.

BibTeX entry:

   author = {P. Larra{\~n}aga and H. Karshenas and C. Bielza and R. Santana},
   title = {A review on probabilistic graphical models in evolutionary
   journal = {Journal of Heuristics},
   volume = {18},
   number = {5},
   pages = {795--819},
   year = {2012},
   url = {http://dx.doi.org/10.1007/s10732-012-9208-4}

(This webpage was created with bibtex2web.)

Back to Roberto Santana publications.