Adaptive Evolutionary Algorithm Based on a Cliqued Gibbs Sampling over Graphical Markov Model Structure

DOI10.1007/978-3-642-28900-2_7zbMath1251.68215OpenAlexW48381842MaRDI QIDQ4649193

Elva Diaz-Diaz, Eunice Esther Ponce-de-Leon-Senti

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_7

Mathematics Subject Classification ID

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

Related Items (1)

A review of message passing algorithms in estimation of distribution algorithms

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Schemata, distributions and graphical models in evolutionary optimization
• Markov Random Fields and Their Applications
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Approximating discrete probability distributions with dependence trees
• A new look at the statistical model identification

This page was built for publication: Adaptive Evolutionary Algorithm Based on a Cliqued Gibbs Sampling over Graphical Markov Model Structure