DocumentCode
2732109
Title
Incorporating a Metropolis method in a distribution estimation using Markov random field algorithm
Author
Shakya, Siddhartha K. ; McCall, John A W ; Brown, Deryck F.
Author_Institution
Sch. of Comput., Robert Gordon Univ., Aberdeen, UK
Volume
3
fYear
2005
fDate
2-5 Sept. 2005
Firstpage
2576
Abstract
Markov random field (MRF) modelling techniques have been recently proposed as a novel approach to probabilistic modelling for estimation of distribution algorithms (EDAs) (S. K. Shakya et al., 2004). An EDA using this technique was called distribution estimation using Markov random fields (DEUM). DEUM was later extended to DEUMd (S. Shakya et al., 2005). DEUM and DEUMd use a univariate model of probability distribution, and have been shown to perform better than other univariate EDAs for a range of optimization problems. This paper extends DEUMd to incorporate a simple Metropolis method and empirically shows that for linear univariate problems the proposed univariate MRF models are very effective. In particular, the proposed DEUMd algorithm can find the solution in O(n) fitness evaluations. Furthermore, we suggest that the Metropolis method can also be used to extend the DEUM approach to multivariate problems.
Keywords
Markov processes; distributed algorithms; estimation theory; optimisation; statistical distributions; DEUM; MRF modelling; Markov random field algorithm; Metropolis method; distribution algorithms; distribution estimation; linear univariate problems; optimization problems; probabilistic modelling; probability distribution; univariate EDA; Biological cells; Distributed computing; Electronic design automation and methodology; Evolutionary computation; Genetic algorithms; Genetic mutations; Markov random fields; Probability distribution; Random variables; Sampling methods;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2005. The 2005 IEEE Congress on
Print_ISBN
0-7803-9363-5
Type
conf
DOI
10.1109/CEC.2005.1555017
Filename
1555017
Link To Document