Intelligent bias of network structures in the hierarchical BOA

Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009

Volumn , Issue , 2009, Pages 413-420

  Hauschild, Mark W ^a   Pelikan, Martin ^a  

^a UNIVERSITY OF MISSOURI ST LOUIS   (United States)

Author keywords

Bayesian optimization algorithm; Efficiency enhancement; Estimation of distribution algorithms; Hierarchical BOA; Learning from experience; Model complexity

Indexed keywords

BAYESIAN NETWORK MODELS; BAYESIAN OPTIMIZATION ALGORITHMS; CANDIDATE SOLUTION; ESTIMATION OF DISTRIBUTION ALGORITHMS; GLOBAL OPTIMUM; HIERARCHICAL BAYESIAN; HIGH PROBABILITY; MODEL COMPLEXITY; NETWORK STRUCTURES; PROBABILISTIC MODELS; ROADMAP; STOCHASTIC OPTIMIZATION TECHNIQUES; UNIFORM DISTRIBUTION;

BAYESIAN NETWORKS; COMPUTATIONAL EFFICIENCY; ESTIMATION; EVOLUTIONARY ALGORITHMS; INFERENCE ENGINES; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; SPIN GLASS; TECHNOLOGICAL FORECASTING;

LEARNING ALGORITHMS;

EID: 72749090826     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1569901.1569959     Document Type: Conference Paper

References (30)

1. D. H. Ackley. An empirical study of bit vector function optimization. Genetic Algorithms and Simulated Annealing, pages 170-204, 1987.
2. S. Baluja. Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning. Tech. Rep. No. CMU-CS-94-163, Carnegie Mellon University, Pittsburgh, PA, 1994.
3. S. Baluja. Incorporating a priori knowledge in probabilistic-model based optimization. In M. Pelikan, K. Sastry, and E. Cantú-Paz, editors, Scalable optimization via probabilistic modeling: From algorithms to applications, pages 205-219. Springer, 2006.
4. D. M. Chickering, D. Heckerman, and C. Meek. A Bayesian approach to learning Bayesian networks with local structure. Technical Report MSR-TR-97-07, Microsoft Research, Redmond, WA, 1997.
5. P. Dayal, S. Trebst, S. Wessel, D. Würtz, M. Troyer, S. Sabhapandit, and S. Coppersmith. Performance limitations of flat histogram methods and optimality of Wang-Langdau sampling. Physical Review Letters, 92(9):097201, 2004.
6. K. Deb and D. E. Goldberg. Sufficient conditions for deceptive and easy binary functions. Annals of Mathematics and Artificial Intelligence, 10:385-408, 1994.
7. N. Friedman and M. Goldszmidt. Learning Bayesian networks with local structure. In M. I. Jordan, editor, Graphical models, pages 421-459. MIT Press, 1999.
8. G. R. Harik. Finding multimodal solutions using restricted tournament selection. International Conf. on Genetic Algorithms (ICGA-95), pages 24-31, 1995.
9. M. Hauschild, M. Pelikan, C. Lima, and K. Sastry. Analyzing probabilistic models in hierarchical BOA on traps and spin glasses. Genetic and Evolutionary Computation Conf. (GECCO-2007), I:523-530, 2007.
10. M. Hauschild, M. Pelikan, K. Sastry, and D. E. Goldberg. Using previous models to bias structural learning in the hierarchical BOA. Genetic and Evolutionary Computation Conf. (GECCO-2008), pages 415-422, 2008.
11. D. Heckerman, D. Geiger, and D. M. Chickering. Learning Bayesian networks: The combination of knowledge and statistical data. Technical Report MSR-TR-94-09, Microsoft Research, Redmond, WA, 1994.
12. R. A. Howard and J. E. Matheson. Influence diagrams. In R. A. Howard and J. E. Matheson, editors, Readings on the principles and applications of decision analysis, volume II, pages 721-762. Strategic Decisions Group, Menlo Park, CA, 1981.
13. P. Larrañaga and J. A. Lozano, editors. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer, Boston, MA, 2002.
14. C. F. Lima, F. G. Lobo, and M. Pelikan. From mating pool distributions to model overfitting. In GECCO '08: Proc. of the 10th annual conference on Genetic and evolutionary computation, pages 431-438, New York, NY, USA, 2008. ACM.
15. H. Mühlenbein and T. Mahnig. Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning. International Journal on Approximate Reasoning, 31(3):157-192, 2002.
16. H. Mühlenbein, T. Mahnig, and A. O. Rodriguez. Schemata, distributions and graphical models in evolutionary optimization. Submitted for publication, 1998.
17. J. Pearl. Probabilistic reasoning in intelligent systems: Networks of plausible inference. Morgan Kaufmann, San Mateo, CA, 1988.
18. M. Pelikan. Hierarchical Bayesian optimization algorithm: Toward a new generation of evolutionary algorithms. Springer-Verlag, 2005.
19. M. Pelikan and D. E. Goldberg. Escaping hierarchical traps with competent genetic algorithms. Genetic and Evolutionary Computation Conf. (GECCO-2001), pages 511-518, 2001.
20. M. Pelikan and D. E. Goldberg. Hierarchical BOA solves Ising spin glasses and MAXSAT. Genetic and Evolutionary Computation Conf. (GECCO-2003), II:1275-1286, 2003.
21. M. Pelikan and D. E. Goldberg. Hierarchical Bayesian optimization algorithm. In M. Pelikan, K. Sastry, and E. Cantú-Paz, editors, Scalable optimization via probabilistic modeling: From algorithms to applications, pages 63-90. Springer, 2006.
22. M. Pelikan, D. E. Goldberg, and F. Lobo. A survey of optimization by building and using probabilistic models. Computational Optimization and Applications, 21(1):5-20, 2002.
23. M. Pelikan, K. Sastry, and E. Cantú-Paz, editors. Scalable optimization via probabilistic modeling: From algorithms to applications. Springer-Verlag, 2006.
24. M. Pelikan, K. Sastry, and D. E. Goldberg. Scalability of the Bayesian optimization algorithm. Int. Journal of Approximate Reasoning, 31(3):221-258, 2002.
25. R. Santana, P. Larrañaga, and J. A. Lozano. The role of a priori information in the minimization of contact potentials by means of estimation of distribution algorithms. In E. Marchiori, J. H. Moore, and J. C. Rajapakse, editors, Proc. of the 5th European Conf. on Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics, volume 4447 of Lecture Notes in Computer Science, pages 247-257. Springer, 2007.
26. K. Sastry. Efficient atomic cluster optimization using a hybrid extended compact genetic algorithm with seeded population. IlliGAL Report No. 2001018, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL, 2001.
27. K. Sastry. Evaluation-relaxation schemes for genetic and evolutionary algorithms. Master's thesis, University of Illinois at Urbana-Champaign, Department of General Engineering, Urbana, IL, 2001.
28. J. Schwarz and J. Ocenasek. A problem-knowledge based evolutionary algorithm KBOA for hypergraph partitioning, 2000. Personal communication.
29. Spin Glass Ground State Server. http://www.informatik. uni-koeln.de/ls\-juenger/research/sgs/sgs.html, 2004. University of Köln, Germany.
30. D. Thierens. Scalability problems of simple genetic algorithms. Evolutionary Computation, 7(4):331-352, 1999.