Difficulty of linkage learning in estimation of distribution algorithms

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

Volumn , Issue , 2009, Pages 397-403

  Chen, Si Cheng ^a   Yu, Tian Li ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Estimation of distribution algorithms; Genetic algorithms; Linkage learning; Parity function

Indexed keywords

CONVERGENCE MODEL; EMPIRICAL FINDINGS; ESTIMATION OF DISTRIBUTION ALGORITHMS; INDEPENDENT FUNCTIONS; LEARNING MECHANISM; LINKAGE LEARNING; PARITY FUNCTIONS; POLYNOMIAL NUMBER; PROBLEM SIZE; TRAP FUNCTIONS;

EDUCATION; ESTIMATION; EVOLUTIONARY ALGORITHMS; FUNCTION EVALUATION;

LEARNING ALGORITHMS;

EID: 72749088460     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1569901.1569957     Document Type: Conference Paper

References (24)

1. D. H. Ackley. A connectionist machine for genetic hillclimbing. Kluwer Academic Publishers, Norwell, MA, USA, 1987.
2. S. Baluja. Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning. Technical report, Carnegie Mellon University, Pittsburgh, PA, USA, 1994.
3. J. S. D. Bonet, C. L. Isbell, and P. Viola. Mimic: Finding optima by estimating probability densities. In M. J. M.C. Mozer and T. Petsche, editors, Advances in Neural Information Processing Systems, volume 9, page 424. The MIT Press, 1997.
4. D. Coffin and R. Smith. The limitations of distribution sampling for linkage learning. In Evolutionary Computation, 2007. CEC 2007. IEEE Congress on, pages 364-369, Sept. 2007.
5. C. Echegoyen, R. Santana, J. A. Lozano, and P. Larrañaga. The impact of exact probabilistic learning algorithms in edas based on bayesian networks. Linkage in Evolutionary Computation, pages 109-139, 2008.
6. L. Emmendorfer and A. Pozo. A clustering-based approach for linkage learning applied to multimodal optimization. Linkage in Evolutionary Computation, pages 225-248, 2008.
7. R. Etxeberria and P. Larrañaga. Global optimization using bayesian networks. In Second Symposium on Artificial Intelligence (CIMAF-99), pages 332-339, 1999.
8. S. Forrest and M. Mitchell. What makes a problem hard for a genetic algorithm? some anomalous results and their explanation. In Machine Learning, pages 285-319, 1993.
9. D. E. Goldberg. Genetic algorithms and walsh functions: Part i, a gentle introduction. In Complex Systems, volume 3, pages 129 - 152, 1989.
10. D. E. Goldberg. The Design of Innovation: Lessons from and for Competent Genetic Algorithms, chapter 12, pages 187-216. Kluwer Academic Publishers, Norwell, MA, USA, 2002.
11. D. E. Goldberg, K. Deb, and J. H. Clark. Genetic algorithms, noise, and the sizing of populations. In Complex Systems, volume 6, pages 333 - 362, 1992.
12. G. Harik. Linkage learning via probabilistic modeling in the ecga. Technical report, IlliGAL, University of Illinois at Urbana-Champaign, 1999.
13. G. Harik, E. Cantú-Paz, D. E. Goldberg, and B. L. Miller. The gambler's ruin problem, genetic algorithms, and the sizing of populations. Evolutionary Computation, 7(3):231-253, 1999.
14. G. Harik, F. Lobo, and D. Goldberg. The compact genetic algorithm. In Evolutionary Computation, 2007. CEC 2007. IEEE Congress on, pages 523-528, May 1998.
15. P. Larrañaga and J. A. Lozano, editors. Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer Academic Publishers, 2002.
16. C. Lima, M. Pelikan, D. Goldberg, F. Lobo, K. Sastry, and M. Hauschild. Influence of selection and replacement strategies on linkage learning in boa. In Evolutionary Computation, 2007. CEC 2007. IEEE Congress on, pages 1083-1090, Sept. 2007.
17. H. Mühlenbein and G. Paass. From recombination of genes to the estimation of distributions i. binary parameters. In PPSN IV: Proceedings of the 4th International Conference on Parallel Problem Solving from Nature, pages 178-187, London, UK, 1996. Springer-Verlag.
18. M. Pelikan and D. E. Goldberg. Escaping hierarchical traps with competent genetic algorithms. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO2001), pages 511-518. Morgan Kaufmann, 2001.
19. M. Pelikan, D. E. Goldberg, and E. Cantú-Paz. Boa: The bayesian optimization algorithm. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-99), pages 525-532, 1999.
20. M. Pelikan, D. E. Goldberg, and F. G. Lobo. A survey of optimization by building and using probabilistic models. Comput. Optim. Appl., 21(1):5-20, 2002.
21. M. Pelikan and H. Mühlenbein. The bivariate marginal distribution algorithm. In R. Roy, T. Furuhashi, and P. Chawdhry, editors, Advances in Soft Computing - Engineering Design and Manufacturing, pages 521-535, London, 1999.
22. M. Tsuji, M. Munetomo, and K. Akama. Modeling dependencies of loci with string classification according to fitness differences. In Genetic and Evolutionary Computation (GECCO 2004), pages 246-257, 2004.
23. H. Wu and J. L. Shapiro. Does overfitting affect performance in estimation of distribution algorithms. In GECCO '06: Proceedings of the 8th annual conference on Genetic and evolutionary computation, pages 433-434, New York, NY, USA, 2006. ACM.
24. T.-L. Yu, D. E. Goldberg, A. Yassine, and Y.-P. Chen. A genetic algorithm design inspired by organization theory: a pilot study of a dependency structure matrix driven genetic algorithm. Technical report, IlliGAL, University of Illinois at Urbana-Champaign, Urbana, IL, 2003.