DEUM - Distribution estimation using Markov networks

Citation

Shakya S, McCall J, Brownlee A & Owusu G (2012) DEUM - Distribution estimation using Markov networks. In: Shakya S & Santana R (eds.) Markov Networks in Evolutionary Computation. Adaptation, Learning, and Optimization, 14. Berlin Heidelberg: Springer, pp. 55-71. http://link.springer.com/chapter/10.1007/978-3-642-28900-2_4#

Abstract
DEUM is one of the early EDAs to use Markov Networks as its model of probability distribution. It uses undirected graph to represent variable interaction in the solution, and builds a model of fitness function from it. The model is then fitted to the set of solutions to estimate the Markov network parameters; these are then sampled to generate new solutions. Over the years, many differentDEUMalgorithms have been proposed. They range from univariate version that does not assume any interaction between variables, to fully multivariate version that can automatically find structure and build fitness models. This chapter serves as an introductory text on DEUM algorithm. It describes the motivation and the key concepts behind these algorithms. It also provides workflow of some of the key DEUM algorithms.

People

Dr Sandy Brownlee

Senior Lecturer in Computing Science, Computing Science and Mathematics - Division