Skip header navigation
×

Conference Proceeding

A fully multivariate DEUM algorithm

Citation
Shakya SK, Brownlee A, McCall J, Fournier FA & Owusu G (2009) A fully multivariate DEUM algorithm. In: IEEE Congress on Evolutionary Computation, 2009. CEC '09. IEEE Congress on Evolutionary Computation, 2009. CEC '09, Trondheim, 18.05.2009-21.05.2009. Piscataway, NJ: IEEE, pp. 479-486. http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=4982984&abstractAccess=no&userType=inst; https://doi.org/10.1109/CEC.2009.4982984

Abstract
Distribution Estimation Using Markov network (DEUM) algorithm is a class of estimation of distribution algorithms that uses Markov networks to model and sample the distribution. Several different versions of this algorithm have been proposed and are shown to work well in a number of different optimisation problems. One of the key similarities between all of the DEUM algorithms proposed so far is that they all assume the interaction between variables in the problem to be pre given. In other words, they do not learn the structure of the problem and assume that it is known in advance. Therefore, they may not be classified as full estimation of distribution algorithms. This work presents a fully multivariate DEUM algorithm that can automatically learn the undirected structure of the problem, automatically find the cliques from the structure and automatically estimate a joint probability model of the Markov network. This model is then sampled using Monte Carlo samplers. The proposed DEUM algorithm can be applied to any general optimisation problem even when the structure is not known.

StatusPublished
Author(s)Shakya, Siddhartha K; Brownlee, Alexander; McCall, John; Fournier, Francois A; Owusu, Gilbert
Publication date31/12/2009
Publication date online31/05/2009
PublisherIEEE
Publisher URLhttp://ieeexplore.ieee.org/…no&userType=inst
Place of publicationPiscataway, NJ
ISBN978-1-4244-2958-5
ConferenceIEEE Congress on Evolutionary Computation, 2009. CEC '09
Conference locationTrondheim
Dates
Scroll back to the top