Abstract
This paper presents a Markov random field (MRF) approach to estimating and sampling the probability distribution in populations of solutions. The approach is used to define a class of algorithms under the general heading distribution estimation using Markov random fields (DEUM). DEUM is a subclass of estimation of distribution algorithms (EDAs) where interaction between solution variables is represented as an undirected graph and the joint probability of a solution is factorized as a Gibbs distribution derived from the structure of the graph. The focus of this paper will be on describing the three main characteristics of DEUM framework, which distinguishes it from the traditional EDA. They are: 1) use of MRF models, 2) fitness modeling approach to estimating the parameter of the model and 3) Monte Carlo approach to sampling from the model.
Original language | British English |
---|---|
Pages (from-to) | 262-272 |
Number of pages | 11 |
Journal | International Journal of Automation and Computing |
Volume | 4 |
Issue number | 3 |
DOIs | |
State | Published - Jul 2007 |
Keywords
- Estimation of distribution algorithms
- Evolutionary algorthms
- Fitness modeling
- Gibbs distribution
- Markov random fields