MN-EDA and the use of clique-based factorisations in EDAs

DOI10.1007/978-3-642-28900-2_5zbMATH Open1251.68217OpenAlexW2184402799MaRDI QIDQ4649191FDOQ4649191

Authors: Roberto Santana 

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_5

Recommendations

• A review of estimation of distribution algorithms and Markov networks
• Using Maximum Entropy and Generalized Belief Propagation in Estimation of Distribution Algorithms
• Probabilistic graphical models and Markov networks
• MARLEDA: effective distribution estimation through Markov random fields
• Convergence theorems of estimation of distribution algorithms

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Causation, prediction, and search
• Algorithm 457: finding all cliques of an undirected graph
• Optimization by simulated annealing
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Learning with mixtures of trees.
• Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
• A Theory of Cooperative Phenomena
• Title not available (Why is that?)
• Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem
• Schemata, distributions and graphical models in evolutionary optimization
• Fast fitness improvements in estimation of distribution algorithms using belief propagation
• The factorized distribution algorithm and the minimum relative entropy principle

Cited In (8)

• Probabilistic graphical models and Markov networks
• The factorized distribution algorithm and the minimum relative entropy principle
• A review of estimation of distribution algorithms and Markov networks
• Adaptive evolutionary algorithm based on a cliqued Gibbs sampling over graphical Markov model structure
• DEUM -- distribution estimation using Markov networks
• MARLEDA: effective distribution estimation through Markov random fields
• Fast fitness improvements in estimation of distribution algorithms using belief propagation
• MOA -- Markovian optimisation algorithm

This page was built for publication: MN-EDA and the use of clique-based factorisations in EDAs

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