“A Markov network based
factorized distribution algorithm for optimization”
by Roberto Santana.
In *Proceedings of the 14th European Conference on Machine Learning
(ECML-PKDD 2003)*, (Dubrovnik, Croatia), 2003, pp. 337-348.

In this paper we propose a population based optimization method that uses the estimation of probability distributions. To represent an approximate factorization of the probability, the algorithm employs a junction graph constructed from an independence graph. We show that the algorithm extends the representation capabilities of previous algorithms that use factorizations. A number of functions are used to evaluate the performance of our proposal. The results of the experiments show that the algorithm is able to optimize the functions, outperforming other evolutionary algorithms that use factorizations.

**BibTeX entry:**

@inproceedings{Santana:2003c, author = {Roberto Santana}, title = {A {M}arkov network based factorized distribution algorithm for optimization}, booktitle = {Proceedings of the 14th European Conference on Machine Learning (ECML-PKDD 2003)}, series = {Lecture Notes in Artificial Intelligence}, volume = {2837}, pages = {337-348}, publisher = {Springer}, address = {Dubrovnik, Croatia}, year = {2003}, url = {http://dx.doi.org/10.1007/b13633} }

(This webpage was created with bibtex2web.)

Back to Roberto Santana publications.