You can manage bookmarks using lists, please log in to your user account for this.
Media type:
E-Article
Title:
Learning Factorizations in Estimation of Distribution Algorithms Using Affinity Propagation
Contributor:
Santana, Roberto;
Larrañaga, Pedro;
Lozano, José A.
Published:
MIT Press - Journals, 2010
Published in:
Evolutionary Computation, 18 (2010) 4, Seite 515-546
Language:
English
DOI:
10.1162/evco_a_00002
ISSN:
1063-6560;
1530-9304
Origination:
Footnote:
Description:
Estimation of distribution algorithms (EDAs) that use marginal product model factorizations have been widely applied to a broad range of mainly binary optimization problems. In this paper, we introduce the affinity propagation EDA (AffEDA) which learns a marginal product model by clustering a matrix of mutual information learned from the data using a very efficient message-passing algorithm known as affinity propagation. The introduced algorithm is tested on a set of binary and nonbinary decomposable functions and using a hard combinatorial class of problem known as the HP protein model. The results show that the algorithm is a very efficient alternative to other EDAs that use marginal product model factorizations such as the extended compact genetic algorithm (ECGA) and improves the quality of the results achieved by ECGA when the cardinality of the variables is increased.