Using a Markov network model in a univariate EDA: An empirical cost-benefit analysis

GECCO 2005 - Genetic and Evolutionary Computation Conference

Volumn , Issue , 2005, Pages 727-734

  Shakya, Siddhartha ^a   McCall, John ^a   Brown, Deryck ^a  

^a ROBERT GORDON UNIVERSITY   (United Kingdom)

Author keywords

Estimation of Distribution Algorithms; Evolutionary Computation; Probabilistic Modelling

Indexed keywords

COST BENEFIT ANALYSIS; MARKOV PROCESSES; MATHEMATICAL MODELS; OPTIMIZATION; PROBABILISTIC LOGICS; PROBLEM SOLVING;

ESTIMATION OF DISTRIBUTION ALGORITHMS; PROBABILISTIC MODELLING;

EVOLUTIONARY ALGORITHMS;

EID: 32444439999     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1068009.1068130     Document Type: Conference Paper

References (25)

1. S. Baluja. Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning,. Technical Report CMU-CS-94-163, Pittsburgh, PA, 1994.
2. S. Baluja and S. Davies, Using optimal dependency-trees for combinatorial optimization: Learning the structure of the search space. In Proceedings of the 1997 International Conference on Machine Learning, 1997.
3. D. F. Brown, A. B. Garmendia-Doval, and J. A. W. McCall. Markov Random Field Modelling of Royal Road Genetic Algorithms. Lecture Notes in Computer Science, 2310:65-78, January 2002.
4. L. Davis, editor, Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York, 1991.
5. L. delaOssa, J. A. Gámez, and J. M. Puerta. Migration of Probability Models Instead of Individuals; An Alternative When Applying the Island Model to EDAs. In Parallel Problem Solving from Nature VIII, pages 242-252. Springer, 2004.
6. D. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, 1989.
7. G. Golub and C. Van Loan, Matrix Computations. Baltimore, MD, second edition, 1989.
8. G. R. Harik, F. G. Lobo, and D. E. Goldberg. The compact genetic algorithm. IEEE-EC, 3(4):287, November 1999.
9. H. H. Hoos and T. Stutzle. Towards a characterisation of the behaviour of stochastic local search algorithms for SAT. Artificial Intelligence, 112(1-2);213-232, 1999.
10. P. Larrañaga, R. Etxeberria, J. Lozano, and J. Peña. Optimization by learning and simulation of bayesian and gaussian networks. Technical Report EHU-KZAA-IK-4/99, University of the Basque Country, 1999.
11. P. Larrañaga and J. A. Lozano. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers, 2001.
12. S. Z. Li. Markov Random Field modeling in computer vision. Springer-Verlag, 1995.
13. H. Mühlenbein. Evolutionary algorithms and the boltzmann distribution. In Foundations of Genetic Algorithms (FOGA2002).
14. H. Mühlenbein. The science of breeding and its application to the breeder genetic algorithm. Evolutionary Computation, 1:pp. 335-360., 1994.
15. H. Mühlenbein and R. Höns, A theoretical and experimental investigation of estimation of distribution algorithms. In Optimization by Building and Using Probabilistic Models (OBUPM-2004).
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 G. Paaß. From recombination of genes to the estimation of distributions: I. binary parameters. In H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schwefel, editors, Parallel Problem Solving from Nature - PPSN IV, pages 178-187, Berlin, 1996. Springer.
18. I. Murray and Z. Ghahramani. Bayesian Learning in Undirected Graphical Models: Approximate MCMC algorithms. In Twentieth Conference on Uncertainty in Artificial Intelligence (UAI 2004), Banff, Canada, 8-11 July 2004.
19. M. Pelikan, Bayesian optimization algorithm: From single level to hierarchy. PhD thesis, University of Illinois at Urbana-Champaign, Urbana, IL, 2002, Also IlliGAL Report No, 2002023.
20. M. Pelikan and D. E. Goldberg. Hierarchical BOA solves Ising spin glasses and MAXSAT, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2003), pages 1271-1282, 2003. Also IlliGAL Report No. 2003001.
21. M. Pelikan, D. E. Goldberg, and F. Lobo, A survey of optimization by building and using probabilistic models. Technical Report 99018, Illinois Genetic Algorithms Lab, UIUC, Urbana, IL, 1999.
22. W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery. Numerical Recipes in C: The Art of Scientific Computing. Cambridge University Press, Cambridge, UK, 2nd edition, 1993.
23. S. Shakya, J. McCall, and D. Brown. Estimating the distribution in an EDA. In B. Ribeiro, R. F. Albrechet, A. Dobnikar, D. W. Pearson, and N. C. Steele, editors, In proceedings of the International Conference on Adaptive and Natural computiNG Algorithms (ICANNGA 2005), pages 202-205, Coimbra, Portugal, 2005. Springer-Verlag, Wien.
24. S. K. Shakya, J. A. W. McCall, and D. F. Brown. Updating the probability vector using MRF technique for a Univariate EDA. In E. Onaindia and S. Staab, editors, Proceedings of the Second Starting AI Researchers' Symposium, pages 15-25, Valencia, Spain, 2004. IDS press.
25. R. Suda and S. Kuriyama. Another preprocessing algorithm for generalized one-dimensional fast multipole method. Journal of Computational Physics, 195:790-803, 2004.