ABSTRACT
Introducing efficient Bayesian learning algorithms in Bayesian network based EDAs seems necessary in order to use them for large problems. In this paper we propose an algorithm, called CMSS-BOA, which uses a recently introduced heuristic called max-min parent children (MMPC) [3] in order to constraint the models search space. This algorithm does not consider a fix and small upper bound on the order of interaction between variables and is able solve problems with large number of variables efficiently. We compare the efficiency of CMSS-BOA with standard Bayesian network based EDA for solving several benchmark problems.
- Larranaga, P. and Lozano, J. A. Estimation of Distribution Algorithms. Kluwer Academic publisher, 2002. Google ScholarDigital Library
- Pelikan, M. Bayesian optimization algorithm: from single level to hierarchy, Ph.D. Thesis, University of Illinois, 2006. Google ScholarDigital Library
- Tsamardinos, I., Brown, L. E., Aliferis, C. F. The MMPC hill-climbing Bayesian network structure learning algorithm, Machine Learning Journal, 65(1):31--78, 2006. Google ScholarDigital Library
Index Terms
- Efficient EDA for large opimization problems via constraining the search space of models
Recommendations
Combinatorial effects of local structures and scoring metrics in bayesian optimization algorithm
GEC '09: Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary ComputationBayesian Optimization Algorithm (BOA) has been used with different local structures to represent more complex models and a variety of scoring metrics to evaluate Bayesian network. But the combinatorial effects of these elements on the performance of BOA ...
Analyzing probabilistic models in hierarchical BOA on traps and spin glasses
GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computationThe hierarchical Bayesian optimization algorithm (hBOA) can solve nearly decomposable and hierarchical problems of bounded difficulty in a robust and scalable manner by building and sampling probabilistic models of promising solutions. This paper ...
Model accuracy in the Bayesian optimization algorithm
Evolutionary algorithms (EAs) are particularly suited to solve problems for which there is not much information available. From this standpoint, estimation of distribution algorithms (EDAs), which guide the search by using probabilistic models of the ...
Comments