Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Theory refinement on Bayesian networks
Proceedings of the seventh conference (1991) on Uncertainty in artificial intelligence
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Search, polynomial complexity, and the fast messy genetic algorithm
Search, polynomial complexity, and the fast messy genetic algorithm
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
Learning Bayesian networks with local structure
Learning in graphical models
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Using Optimal Dependency-Trees for Combinational Optimization
ICML '97 Proceedings of the Fourteenth International Conference on Machine Learning
Proceedings of the 5th International Conference on Genetic Algorithms
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
Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning
The equation for response to selection and its use for prediction
Evolutionary Computation
The gambler's ruin problem, genetic algorithms, and the sizing of populations
Evolutionary Computation
A Survey of Optimization by Building and Using Probabilistic Models
Computational Optimization and Applications
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Optimization in continuous domain by real-coded estimation of distribution algorithm
Design and application of hybrid intelligent systems
Sub-structural niching in estimation of distribution algorithms
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
A comparison study between genetic algorithms and bayesian optimize algorithms by novel indices
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Convergence Time for the Linkage Learning Genetic Algorithm
Evolutionary Computation
Compact representations as a search strategy: compression EDAs
Theoretical Computer Science - Foundations of genetic algorithms
Adaptive estimated maximum-entropy distribution model
Information Sciences: an International Journal
Scalable estimation-of-distribution program evolution
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Introducing assignment functions to Bayesian optimization algorithms
Information Sciences: an International Journal
Optimal query complexity bounds for finding graphs
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
An information geometry perspective on estimation of distribution algorithms: boundary analysis
Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Cooperative co-evolution of GA-based classifiers based on input decomposition
Engineering Applications of Artificial Intelligence
An Evolutionary ILS-Perturbation Technique
HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
BAIS: A Bayesian Artificial Immune System for the effective handling of building blocks
Information Sciences: an International Journal
An automated ligand evolution system using Bayesian optimization algorithm
WSEAS Transactions on Information Science and Applications
Program Evolution for General Intelligence
Proceedings of the 2007 conference on Advances in Artificial General Intelligence: Concepts, Architectures and Algorithms: Proceedings of the AGI Workshop 2006
Data-intensive computing for competent genetic algorithms: a pilot study using meandre
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Computers and Operations Research
CODES+ISSS '09 Proceedings of the 7th IEEE/ACM international conference on Hardware/software codesign and system synthesis
Optimal contraction theorem for exploration-exploitation tradeoff in search and optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Quantum-inspired evolutionary algorithm: a multimodel EDA
IEEE Transactions on Evolutionary Computation - Special issue on evolutionary algorithms based on probabilistic models
Reinforcement learning estimation of distribution algorithm
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Hierarchical BOA solves ising spin glasses and MAXSAT
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Optimal query complexity bounds for finding graphs
Artificial Intelligence
Discovering promising regions to help global numerical optimization algorithms
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Entropy-based substructural local search for the bayesian optimization algorithm
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Quantum-inspired evolutionary algorithms: a survey and empirical study
Journal of Heuristics
Use of infeasible individuals in probabilistic model building genetic network programming
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions
Journal of Computer and System Sciences
A selecto-recombinative genetic algorithm with continuous chromosome reconfiguration
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
A simulated annealing method based on a specialised evolutionary algorithm
Applied Soft Computing
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
An adaptive genetic algorithm for the minimal switching graph problem
EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization
Using ensemble method to improve the performance of genetic algorithm
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
Fluctuating crosstalk as a source of deterministic noise and its effects on GA scalability
EuroGP'06 Proceedings of the 2006 international conference on Applications of Evolutionary Computing
A new approach belonging to EDAs: quantum-inspired genetic algorithm with only one chromosome
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
Sub-structural niching in non-stationary environments
AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence
Compact genetic codes as a search strategy of evolutionary processes
FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms
Information Sciences: an International Journal
A survey on optimization metaheuristics
Information Sciences: an International Journal
An analysis on separability for Memetic Computing automatic design
Information Sciences: an International Journal
Hi-index | 0.00 |
This paper proposes an algorithm that uses an estimation of the joint distribution of promising solutions in order to generate new candidate solutions. The algorithm is settled into the context of genetic and evolutionary computation and the algorithms based on the estimation of distributions. The proposed algorithm is called the Bayesian Optimization Algorithm (BOA). To estimate the distribution of promising solutions, the techniques for modeling multivariate data by Bayesian networks are used. The BOA identifies, reproduces, and mixes building blocks up to a specified order. It is independent of the ordering of the variables in strings representing the solutions. Moreover, prior information about the problem can be incorporated into the algorithm, but it is not essential. First experiments were done with additively decomposable problems with both nonoverlapping as well as overlapping building blocks. The proposed algorithm is able to solve all but one of the tested problems in linear or close to linear time with respect to the problem size. Except for the maximal order of interactions to be covered, the algorithm does not use any prior knowledge about the problem. The BOA represents a step toward alleviating the problem of identifying and mixing building blocks correctly to obtain good solutions for problems with very limited domain information.