Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms
Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms
Algorithm 457: finding all cliques of an undirected graph
Communications of the ACM
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
A Survey of Optimization by Building and Using Probabilistic Models
Computational Optimization and Applications
From Recombination of Genes to the Estimation of Distributions I. Binary Parameters
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Dependency networks for inference, collaborative filtering, and data visualization
The Journal of Machine Learning Research
Phase Transitions in Combinatorial Optimization Problems - Basics, Algorithms and Statistical Mechanics
Survey propagation: An algorithm for satisfiability
Random Structures & Algorithms
Estimation of Distribution Algorithms with Kikuchi Approximations
Evolutionary Computation
Learning Bayesian Networks
A matrix approach for finding extrema: problems with modularity, hierarchy, and overlap
A matrix approach for finding extrema: problems with modularity, hierarchy, and overlap
Sporadic model building for efficiency enhancement of the hierarchical BOA
Genetic Programming and Evolvable Machines
Clustering by soft-constraint affinity propagation
Bioinformatics
Proceedings of the 10th annual conference on Genetic and evolutionary computation
EDNA: Estimation of Dependency Networks Algorithm
IWINAC '07 Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks
Enhancing the Efficiency of the ECGA
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
An Immune Algorithm for Protein Structure Prediction on Lattice Models
IEEE Transactions on Evolutionary Computation
Protein Folding in Simplified Models With Estimation of Distribution Algorithms
IEEE Transactions on Evolutionary Computation
Constructing free-energy approximations and generalized belief propagation algorithms
IEEE Transactions on Information Theory
Affinity propagation enhanced by estimation of distribution algorithms
Proceedings of the 13th annual conference on Genetic and evolutionary computation
A Markovianity based optimisation algorithm
Genetic Programming and Evolvable Machines
A review on probabilistic graphical models in evolutionary computation
Journal of Heuristics
| Hi-index | 0.00 |
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.