Evolutionary optimization using graphical models
New Generation Computing - Special issue on real world computing project
Properties of fitness functions and search landscapes
Theoretical aspects of evolutionary computing
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
Using Optimal Dependency-Trees for Combinational Optimization
ICML '97 Proceedings of the Fourteenth International Conference on Machine Learning
Bayesian optimization algorithm: from single level to hierarchy
Bayesian optimization algorithm: from single level to hierarchy
Linkage learning, overlapping building blocks, and systematic strategy for scalable recombination
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Estimation of Distribution Algorithms with Kikuchi Approximations
Evolutionary Computation
Towards a New Evolutionary Computation: Advances on Estimation of Distribution Algorithms (Studies in Fuzziness and Soft Computing)
Population sizing for entropy-based model building in discrete estimation of distribution algorithms
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Introducing assignment functions to Bayesian optimization algorithms
Information Sciences: an International Journal
Predictive models for the breeder genetic algorithm i. continuous parameter optimization
Evolutionary Computation
An EDA based on local markov property and gibbs sampling
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Mining probabilistic models learned by EDAs in the optimization of multi-objective problems
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Structure learning and optimisation in a Markov-network based estimation of distribution algorithm
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
A fully multivariate DEUM algorithm
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Using over-sampling in a Bayesian classifier EDA to solve deceptive and hierarchical problems
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Analyzing probabilistic models in hierarchical BOA
IEEE Transactions on Evolutionary Computation - Special issue on evolutionary algorithms based on probabilistic models
Spurious dependencies and EDA scalability
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Use of infeasible individuals in probabilistic model building genetic network programming
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Model accuracy in the Bayesian optimization algorithm
Soft Computing - A Fusion of Foundations, Methodologies and Applications
| Hi-index | 0.00 |
Learning a good model structure is important to the efficient solving of problems by estimation of distribution algorithms. In this paper we present the results of a series of experiments, applying a structure learning algorithm for undirected probabilistic graphical models based on statistical dependency tests to three fitness functions with different selection operators, proportions and pressures. The number of spurious interactions found by the algorithm are measured and reported. Truncation selection, and its complement (selecting only low fitness solutions) prove quite robust, resulting in a similar number of spurious dependencies regardless of selection pressure. In contrast, tournament and fitness proportionate selection are strongly affected by the selection proportion and pressure.