Convergence theorems of estimation of distribution algorithms

DOI10.1007/978-3-642-28900-2_6MaRDI QIDQ4649192zbMATH OpenOpenAlexFDO

Authors H. Mühlenbein

Publication date 20 November 2012

Published in Adaptation, Learning, and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-28900-2_6

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graphical methods in statistics (62A09) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1754724
• Using Maximum Entropy and Generalized Belief Propagation in Estimation of Distribution Algorithms
• Learning Structure Illuminates Black Boxes – An Introduction to Estimation of Distribution Algorithms
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• The factorized distribution algorithm and the minimum relative entropy principle

Cites work

• scientific article; zbMATH DE number 4060768 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• scientific article; zbMATH DE number 2061729 (Why is no real title available?)
• scientific article; zbMATH DE number 1754526 (Why is no real title available?)
• scientific article; zbMATH DE number 840151 (Why is no real title available?)
• An introduction to MCMC for machine learning
• Bounding the convergence time of the Gibbs sampler in Bayesian image restoration
• Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning.
• Factor graphs and the sum-product algorithm
• Learning factor graphs in polynomial time and sample complexity
• MARLEDA: effective distribution estimation through Markov random fields
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Schemata, distributions and graphical models in evolutionary optimization
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• The factorized distribution algorithm and the minimum relative entropy principle

Cited in

(12)

• Convergence of the Guesstimation Algorithm
• scientific article; zbMATH DE number 1754724 (Why is no real title available?)
• A review of message passing algorithms in estimation of distribution algorithms
• The factorized distribution algorithm and the minimum relative entropy principle
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• Adaptive evolutionary algorithm based on a cliqued Gibbs sampling over graphical Markov model structure
• A Boltzmann based estimation of distribution algorithm
• A factor graph based genetic algorithm
• Towards the geometry of estimation of distribution algorithms based on the exponential family
• Fast fitness improvements in estimation of distribution algorithms using belief propagation
• Estimation of distribution algorithms on non-separable problems
• MN-EDA and the use of clique-based factorisations in EDAs

This page was built for publication: Convergence theorems of estimation of distribution algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649192)