Genetic algorithms and fitness variance with an application to the automated design of artificial neural networks
Finite Markov chain results in evolutionary computation: a tour d'horizon
Fundamenta Informaticae
LEARNABLE EVOLUTION MODEL: Evolutionary Processes Guided by Machine Learning
Machine Learning - Special issue on multistrategy learning
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
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
Combinatonal Optimization by Learning and Simulation of Bayesian Networks
UAI '00 Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning
Using a Markov network model in a univariate EDA: an empirical cost-benefit analysis
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Genetic drift in univariate marginal distribution algorithm
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Drift and Scaling in Estimation of Distribution Algorithms
Evolutionary Computation
Optimising cancer chemotherapy using an estimation of distribution algorithm and genetic algorithms
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Unit Bit Importance Evolutionary Algorithm
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Side chain placement using estimation of distribution algorithms
Artificial Intelligence in Medicine
Fda -a scalable evolutionary algorithm for the optimization of additively decomposed functions
Evolutionary Computation
Proceedings of the 10th annual conference on Genetic and evolutionary computation
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation
Parallel Implementation of EDAs Based on Probabilistic Graphical Models
IEEE Transactions on Evolutionary Computation
Hybrid Estimation of Distribution Algorithm for the Quay Crane Scheduling Problem
Applied Soft Computing
| Hi-index | 0.00 |
Abstract: In the traditional estimation of distribution algorithms (EDAs), all the variables of candidate individuals are perturbed through sampling from a probability distribution of promising individuals. However, it may be unnecessary for the EDAs to perturb all variables of candidate individuals at each generation. This is because one variable may be dependent on another variable and all variables may have different saliences even if they are independent. Therefore, only a subset of all variables in EDAs really function at each generation. This paper proposes a novel class of EDAs, termed as subspace estimation of distribution algorithms (subEDAs), from a new perspective to reduce the space of variables for use in model building and model sampling based on EDAs' performance. In subEDAs, only part of all variables of candidate individuals are perturbed at each generation. Three schemes are described in details to determine which variables should be perturbed at each generation: the random picking method (RP), the majority voting based on the similarity between high quality individuals (MVSH) and the majority voting based on the difference between high quality and low quality individuals (MVDHL). Then, subEDAs+RP, subEDAs+MVSH and subEDAs+MVDHL are tested on several benchmark functions and their algorithmic results are compared with those obtained by EDAs. Our experimental results indicate that subEDAs are able to obtain a comparative result using only a subset of problem variables in the model when compared with traditional EDAs.