A Markov Network Based Factorized Distribution Algorithm for Optimization
Abstract
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.
Cite
Text
Santana. "A Markov Network Based Factorized Distribution Algorithm for Optimization." European Conference on Machine Learning, 2003. doi:10.1007/978-3-540-39857-8_31Markdown
[Santana. "A Markov Network Based Factorized Distribution Algorithm for Optimization." European Conference on Machine Learning, 2003.](https://mlanthology.org/ecmlpkdd/2003/santana2003ecml-markov/) doi:10.1007/978-3-540-39857-8_31BibTeX
@inproceedings{santana2003ecml-markov,
title = {{A Markov Network Based Factorized Distribution Algorithm for Optimization}},
author = {Santana, Roberto},
booktitle = {European Conference on Machine Learning},
year = {2003},
pages = {337-348},
doi = {10.1007/978-3-540-39857-8_31},
url = {https://mlanthology.org/ecmlpkdd/2003/santana2003ecml-markov/}
}