The factorized distribution algorithm and the minimum relative entropy principle
From MaRDI portal
Recommendations
- Using Maximum Entropy and Generalized Belief Propagation in Estimation of Distribution Algorithms
- Convergence theorems of estimation of distribution algorithms
- MN-EDA and the use of clique-based factorisations in EDAs
- Learning Structure Illuminates Black Boxes – An Introduction to Estimation of Distribution Algorithms
- Schemata, distributions and graphical models in evolutionary optimization
Cited in
(9)- Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning.
- A review of message passing algorithms in estimation of distribution algorithms
- A Boltzmann based estimation of distribution algorithm
- On the use of factorized distribution algorithms for problems defined on graphs
- scientific article; zbMATH DE number 1754526 (Why is no real title available?)
- scientific article; zbMATH DE number 1754531 (Why is no real title available?)
- MN-EDA and the use of clique-based factorisations in EDAs
- Convergence theorems of estimation of distribution algorithms
- Fast fitness improvements in estimation of distribution algorithms using belief propagation
This page was built for publication: The factorized distribution algorithm and the minimum relative entropy principle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5443849)
