On the convergence of an estimation of distribution algorithm based on linkage discovery and factorization

GECCO 2005 - Genetic and Evolutionary Computation Conference

Volumn , Issue , 2005, Pages 695-702

  Wright, Alden H ^a   Pulavarty, S V P M Sandeep ^a  

^a UNIVERSITY OF MONTANA   (United States)

Author keywords

Boltzmann distribution; Estimation of distribution algorithms; Factorization; Genetic algorithms

Indexed keywords

ESTIMATION; FUNCTION EVALUATION; MATHEMATICAL MODELS; PROBABILITY; PROBLEM SOLVING;

BOLTZMANN DISTRIBUTION; ESTIMATION OF DISTRIBUTION ALGORITHMS; FACTORIZATION;

GENETIC ALGORITHMS;

EID: 32444439669     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1068009.1068126     Document Type: Conference Paper

References (28)

1. S. Baluja and R. Caruana. Removing the genetics from the standard genetic algorithm. In A. Prieditis and S. Russel, editors, The Int. Conf. on Machine Learning 1995, pages 38-46, San Mateo, CA, 1995. Morgan Kaufmann Publishers.
2. J. S. de Bonet, C. L. Isbell, Jr., and P. Viola. MIMIC: Finding optima by estimating probability densities. In M. C. M. et. al., editor, Advances in Neural Information Processing Systems, volume 9, page 424. MIT Press, 1997.
3. D. E. Goldberg, K. Deb, H. Kargupta, and G. Harik, Rapid, accurate optimization of difficult optimization problems using fast messy genetic algorithms. In S. Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms, pages 56-64, San Mateo, California, 1993. Morgan Kaufman.
4. G. R. Harik and D. E. Goldberg. Learning linkage. In R. K. Belew and M. D. Vose, editors, Foundations of Genetic Algorithms 4, pages 247-262. Morgan Kaufmann, San Francisco, CA, 1997.
5. G. R. Harik, F. G. Lobo, and D. E. Goldberg. The compact genetic algorithm. IEEE-EC, 3(4):287, November 1999.
6. R. E. Heckendorn and A. H. Wright. Efficient linkage discovery by limited probing. In Erick Cantú Paz et al., editor, Genetic and Evolutionary Computation - GECCO 2003, Lecture Notes in Computer Science LNCS 2724, pages 1003-10014. Springer Verlag, 2003.
7. R. E. Heckendorn and A. H. Wright. Efficient linkage discovery by limited probing. Evolutionary Computation, 12(4):517-545, 2004.
8. I. Holland. Adapdation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, Michigan, 1975.
9. C. Huang and A. Darwiche. Inference in belief networks: A procedural guide. International Journal of Approximate Reasoning, 15(3):225-263, 1996.
10. F. V. Jensen and F. Jensen. Optimal junction trees. In Proceedings of the 10th conference on uncertainty in artificial intelligence, pages 360-366, Seattle, 1994.
11. H. Kargupta. The gene expression messy genetic algorithm. In International Conference on Evolutionary Computation, pages 814-819, 1996.
12. H. Kargupta and B. Park. Gene expression and fast construction of distributed evolutionary representation. Evolutionary Computation, 9(1):43-69, 2001.
13. S. L. Lauritzen. Graphical Models. Clarendon Press, Oxford, 1996.
14. H. Mühlenbein and R. Höns. The estimation of distributions and the maximum relative entropy principle. Evolutionary Computation, 13(1):1-28, 2005.
15. H. Mühlenbein and T. Mahnig. Convergence theory and application of the factorized distribution algorithm. Journal of Computing and Information Technology, 7(1):19-32, 1999.
16. H. Mühlenbein and T. Mahnig. FDA - a scalable evolutionary algorithm for the optimization of additively decomposed functions. Evolutionary Computation, 7(4):353-376, 1999.
17. H. Mühlenbein and T. Mahnig. Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning. International Journal of Approximate Reasoning, 31:157-192, 2002.
18. H. Mühlenbein and T. Mahnig. Evolutionary algorithms and the Boltzmann distribution. In Foundations of genetic algorithms (FOGA-7), pages 133-150, San Mateo, 2003. Morgan Kaufmann.
19. H. Mühlenbein, T. Mahnig, and A. O. Rodriguez. Schemata, distributions and graphical models in evolutionary optimization. Journal of Heuristics, 5:215-247, 1999.
20. H. Mühlenbein and G. Paaß. From recombination of genes to the estimation of distributions I, binary parameters. In Lecture Notes in Computer Science 1411: Parallel Problem Solving from Nature PPSN IV, 1996, pages 178-187. Springer Verlag, 1996.
21. M. Munetomo and D. E. Goldberg. Linkage identification by non-monotonicity detection for overla pping functions. Evolutionary Computation, 7(4):377-398, 1999.
22. M. Pelikan, D. E. Goldberg, and E. Cantú-Paz. BOA: The Bayesian optimization algorithm. In W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith, editors, Proceedings of the Genetic and Evolutionary Computation Conference GECCO-99, volume I, pages 525-532, Orlando, FL, 13-17 1999. Morgan Kaufmann Publishers, San Fransisco, CA.
23. M. Pelikan, D. E. Goldberg, and E. Cantu-Paz. Linkage problem, distribution estimation, and bayesian networks. Evolutionary Computation, 8(3):311-340, 2000.
24. M. Pelikan and H. Mühlenbein. The bivariate marginal distribution algorithm. In R. Roy, T. Furuhashi, and P. K. Chawdhry, editors, Advances in Soft Computing - Engineering Design and Manufacturing, pages 521-535, London, 1999. Springer-Verlag.
25. M. J. Streeter. Upper bounds on the time and space complexity of optimizing additively separable functions. In Kalyanmoy Deb et al., editor, Genetic and Evolutionary Computation - GECCO 2003, procedings part II, Lecture Notes in Computer Science LNCS 3103, pages 186-197. Springer Verlag, 2004.
26. D. Thierens. Analysis and design of genetic algorithms. PhD thesis, Katholieke Universiteit Leuven, Leuven, Belgium, 1995.
27. Q. Zhang. On stability of fixed points of limit models of univariate marginal distribution algorithm and factorized distribution algorithm. IEEE Transations on Evolutionary Computation, 8(1):80-93, 2004.
28. Q. Zhang and H. Mühlenbein. On the convergence of a class of estimation of distribution algoirthms. IEEE Transations on Evolutionary Computation, 8(2):127-136, 2004.