BOA: the Bayesian optimization algorithm
Martin Pelikán, David E. Goldberg, Erick Cantú‐Paz · 1999
In this paper, an algorithm based on the concepts of genetic algorithms that uses an estimation of a probability distribution of promising solutions in order to generate new candidate solutions is proposed. To estimate the distribution, techniques for modeling multivariate data by Bayesian networks are used. The proposed algorithm identifies, reproduces and mixes building blocks up to a specified order. It is independent of the ordering of the variables in the strings representing the solutions. Moreover, prior information about the problem can be incorporated into the algorithm. However, prior information is not essential. Preliminary experiments show that the BOA outperforms the simple genetic algorithm even on decomposable functions with tight building blocks as a problem size grows. 1 INTRODUCTION Recently, there has been a growing interest in optimization methods that explicitly model the good solutions found so far and use the constructed model to guide the fu...
Cited by 934 works.
Authors
References
- Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
- Genetic Algorithms in Search, Optimization and Machine Learning
- Genetic Algorithms in Search
- Messy genetic algorithms: motivation, analysis, and first results
- Learning Bayesian networks: The combination of knowledge and statistical data
- Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning
- From recombination of genes to the estimation of distributions I. Binary parameters
- MIMIC: Finding Optima by Estimating Probability Densities
- The Equation for Response to Selection and Its Use for Prediction
- Using Optimal Dependency-Trees for Combinatorial Optimization: Learning the Structure of the Search Space