Using previous models to bias structural learning in the hierarchical BOA

GECCO'08: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation 2008

Volumn , Issue , 2008, Pages 415-422

  Hauschild, Mark ^a   Sastry, Kumara ^b   Pelikan, Martin ^a   Goldberg, David E ^c  

^a UNIVERSITY OF MISSOURI ST LOUIS   (United States)

^b University of Illinois at Urbana Champaign   (United States)

^c UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Algorithms; Performance

Indexed keywords

ALGORITHMS; EVOLUTIONARY ALGORITHMS; OPTIMIZATION; PROBABILITY DISTRIBUTIONS;

ESTIMATION OF DISTRIBUTION ALGORITHMS; HIERARCHICAL BAYESIAN OPTIMIZATION ALGORITHMS; IMPROVE PERFORMANCE; PERFORMANCE; PROBABILISTIC MODELS; PROBLEM-SPECIFIC KNOWLEDGE; STOCHASTIC OPTIMIZATION TECHNIQUES; STRUCTURAL LEARNING;

STOCHASTIC MODELS;

EID: 57349145283     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1389095.1389172     Document Type: Conference Paper

References (28)

1. 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.
2. D. Boughaci and H. Drias. A performance comparison of evolutionary meta-heuristics and solving MAX-SAT problems. In A. Okatan, editor, International Conference on Computational Intelligence, pages 379-383. International Computational Intelligence Society, 2004.
3. A. E. I. Brownlee, J. A. W. McCall, and D. F. Brown. Solving the MAXSAT problem using a multivariate EDA based on markov networks. In P. A. N. Bosman, editor, Late breaking paper at Genetic and Evolutionary Computation Conference (GECCO'2007), pages 2423-2428, London, United Kingdom, 7-11 July 2007. ACM Press.
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. N. Friedman and M. Goldszmidt. Learning Bayesian networks with local structure. In M. I. Jordan, editor, Graphical models, pages 421-159. MIT Press, 1999.
7. I. Gent, H. H. Hoos, P. Prosser, and T. Walsh. Morphing: Combining structure and randomness. Proceedings of the American Association of Artificial Intelligence (AAAI-99), pages 654-660, 1999.
8. D. E. Goldberg. The design of innovation: Lessons from and for competent genetic algorithms. Kluwer, 2002.
9. J. Gottlieb, E. Marchiori, and C. Rossi. Evolutionary algorithms for the satisfiability problem. Evolutionary Computation, 10(l):35-50, 2002.
10. G. R. Harik. Finding multimodal solutions using restricted tournament selection. International Conference on Genetic Algorithms (ICGA-95), pages 24-31, 1995.
11. M. Hauschild, M. Pelikan, C. Lima, and K. Sastry. Analyzing probabilistic models in hierarchical boa on traps and spin glasses. Genetic and Evolutionary Computation Conference (GECCO-2007), 1:523-530, 2007.
12. H. H. Hoos and T. Stutzle. Satlib: An online resource for research on sat. SAT 2000, pages 283-292, 2000. SATLIB is available online at www.satlib.org.
13. 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.
14. P. Larrañaga and J. A. Lozano, editors. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer, Boston, MA, 2002.
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. J. Pearl. Probabilistic reasoning in intelligent systems: Networks of plausible inference. Morgan Kaufmann, San Mateo, CA, 1988.
17. M. Pelikan. Hierarchical Bayesian optimization algorithm: Toward a new generation of evolutionary algorithms. Springer-Verlag, 2005.
18. M. Pelikan and D. E. Goldberg. Escaping hierarchical traps with competent genetic algorithms. Genetic and Evolutionary Computation Conference (GECCO-2001), pages 511-518, 2001.
19. M. Pelikan and D. E. Goldberg. Hierarchical BOA solves Ising spin glasses and MAXSAT. Genetic and Evolutionary Computation Conference (GECCO-2003), 11:1275-1286, 2003.
20. 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.
21. M. Pelikan, K. Sastry, and E. Cantú-Paz, editors. Scalable optimization via probabilistic modeling: From algorithms to applications. Springer-Verlag, 2006.
22. M. Pelikan, K. Sastry, and D. E. Goldberg. Scalability of the Bayesian optimization algorithm. International Journal of Approximate Reasoning, 31(3):221-258, 2002.
23. S. Rana and D. L. Whitley. Genetic algorithm behavior in the MAXSAT domain. Parallel Problem Solving from Nature, pages 785-794, 1998.
24. 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.
25. 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.
26. K. Sastry, M. Pelikan, and D. E. Goldberg. Efficiency enhancement of estimation of distribution algorithms. In M. Pelikan, K. Sastry, and E. Cantú-Paz, editors, Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications, pages 161-185. Springer, 2006.
27. J. Schwarz and J. Ocenasek. A problem-knowledge based evolutionary algorithm KBOA for hypergraph partitioning, 2000. Personal communication.
28. Spin Glass Ground State Server, http://www.informatik.uni-koeln.de/ls\- juenger/research/sgs/sgs.html, 2004. University of Köln, Germany.