skip to main content
10.1145/1068009.1068130acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
Article

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

Published: 25 June 2005 Publication History

Abstract

This paper presents an empirical cost-benefit analysis of an algorithm called Distribution Estimation Using MRF with direct sampling (DEUMd). DEUMd belongs to the family of Estimation of Distribution Algorithm (EDA). Particularly it is a univariate EDA. DEUMd uses a computationally more expensive model to estimate the probability distribution than other univariate EDAs. We investigate the performance of DEUMd in a range of optimization problem. Our experiments shows a better performance (in terms of the number of fitness evaluation needed by the algorithm to find a solution and the quality of the solution) of DEUMd on most of the problems analysed in this paper in comparison to that of other univariate EDAs. We conclude that use of a Markov Network in a univariate EDA can be of net benefit in defined set of circumstances.

References

[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. MarkovRandom 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. Paas. 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), Ban--, 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. IOS 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.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
GECCO '05: Proceedings of the 7th annual conference on Genetic and evolutionary computation
June 2005
2272 pages
ISBN:1595930108
DOI:10.1145/1068009
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 June 2005

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. estimation of distribution algorithms
  2. evolutionary computation
  3. probabilistic modelling

Qualifiers

  • Article

Conference

GECCO05
Sponsor:

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)1
Reflects downloads up to 20 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2021)Investigating binary EAs for Passive In-Building Distributed Antenna Systems2021 IEEE Congress on Evolutionary Computation (CEC)10.1109/CEC45853.2021.9504731(2101-2108)Online publication date: 28-Jun-2021
  • (2020)Multi-Source Selective Transfer Framework in Multi-Objective Optimization ProblemsIEEE Transactions on Evolutionary Computation10.1109/TEVC.2019.2926107(1-1)Online publication date: 2020
  • (2016)MARLEDATheoretical Computer Science10.1016/j.tcs.2015.07.049633:C(4-18)Online publication date: 20-Jun-2016
  • (2014)Formal Modeling and Analysis of Learning-Based Routing in Mobile Wireless Sensor NetworksIntegration of Reusable Systems10.1007/978-3-319-04717-1_6(127-150)Online publication date: 18-Feb-2014
  • (2013)Fitness Modeling With Markov NetworksIEEE Transactions on Evolutionary Computation10.1109/TEVC.2013.228153817:6(862-879)Online publication date: 1-Dec-2013
  • (2013)Learning-based routing in mobile wireless sensor networks: Applying formal modeling and analysis2013 IEEE 14th International Conference on Information Reuse & Integration (IRI)10.1109/IRI.2013.6642512(504-511)Online publication date: Aug-2013
  • (2013)Network measures for information extraction in evolutionary algorithmsInternational Journal of Computational Intelligence Systems10.1080/18756891.2013.8230046:6(1163-1188)Online publication date: Dec-2013
  • (2013)Critical Issues in Model-Based Surrogate Functions in Estimation of Distribution AlgorithmsProceedings of the 4th International Conference on Swarm, Evolutionary, and Memetic Computing - Volume 829810.1007/978-3-319-03756-1_1(1-13)Online publication date: 19-Dec-2013
  • (2012)Toward Understanding EDAs Based on Bayesian Networks Through a Quantitative AnalysisIEEE Transactions on Evolutionary Computation10.1109/TEVC.2010.210203716:2(173-189)Online publication date: 1-Apr-2012
  • (2012)On the use of Population Based Incremental Learning to do Reverse Engineering on Gene Regulatory Networks2012 IEEE Congress on Evolutionary Computation10.1109/CEC.2012.6256580(1-8)Online publication date: Jun-2012
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media