A markov network based factorized distribution algorithm for optimization

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2837, Issue , 2003, Pages 337-348

  Santana, Roberto ^a  

^a Institute of Cybernetics Mathematics and Physics   (Cuba)

Author keywords

EDA; Estimation of distributions; Evolutionary optimization; FDA; Genetic algorithms

Indexed keywords

APPROXIMATION THEORY; CONVERGENCE OF NUMERICAL METHODS; FUNCTIONS; GRAPH THEORY; MARKOV PROCESSES; MATHEMATICAL MODELS; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; ALGORITHMS; ARTIFICIAL INTELLIGENCE; FACTORIZATION; GENETIC ALGORITHMS; LEARNING SYSTEMS;

ESTIMATION DISTRIBUTION ALGORITHMS (EDA); ESTIMATION OF DISTRIBUTION; EVOLUTIONARY OPTIMIZATION; FACTORIZED DISTRIBUTION ALGORITHM; APPROXIMATE FACTORIZATION; EDA; ESTIMATION OF DISTRIBUTIONS; EVOLUTIONARY OPTIMIZATIONS; FDA; INDEPENDENCE GRAPHS; POPULATION-BASED OPTIMIZATION METHODS;

GENETIC ALGORITHMS; EVOLUTIONARY ALGORITHMS;

EID: 9444227679     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-39857-8_31     Document Type: Conference Paper

References (12)

1. C. Bron and J. Kerbosch. Algorithm 457 - finding all cliques of an undirected graph. Communications of the ACM, 16(6):575-577, 1973.
2. D. F. Brown, A. Garmendia-Doal, and J. A. W. McCall. Markov random field modelling of royal road genetic algorithms. In P. Collet, editor, Proceedings of EA 2001, volume 2310 of Lecture Notes in Computer Science, pages 65-76. Springer Verlag, 2002.
3. M. Henrion. Propagating uncertainty in Bayesian networks by probabilistic logic sampling. Uncertainty in Artificial Intelligence, 2:317-324, 1988.
4. J. H. Holland. Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, MI, 1975.
5. P. Larrañaga and J. A. Lozano. Estimation Distribution Algorithms. A new tool for Evolutionary Optimization. Kluwer Academic Publishers, Boston/Dordrecht/ London, 2001.
6. H. Mühlenbein. The equation for response to selection and its use for prediction. Evolutionary Computation, 5(3):303-346, 1997.
7. H. Mühlenbein and T. Mahnig. Theoretical Aspects of Evolutionary Computing, chapter Evolutionary Algorithms: From Recombination to Search Distributions, pages 137-176. Springer Verlag, Berlin, 2000.
8. H. Mühlenbein and T. Mahnig. Evolutionary synthesis of Bayesian networks for optimization. Advances in Evolutionary Synthesis of Neural Systems, MIT Press, pages 429-455, 2001.
9. H. Mühlenbein, T. Mahnig, and A. Ochoa. Schemata, distributions and graphical models in evolutionary optimization. Journal of Heuristics, 5(2):213-247, 1999.
10. H. Mühlenbein and G. Paaß. From recombination of genes to the estimation of distributions I. Binary parameters. In A. Eiben, T. Bäck, M. Shoenauer, and H. Schwefel, editors, Parallel Problem Solving from Nature - PPSN IV, pages 178-187, Berlin, 1996. Springer Verlag.
11. R. Santana, A. Ochoa, and M. R. Soto. The Mixture of Trees Factorized Distribution Algorithm. In Proceedings of the Genetic and Evolutionary Computation Conference GECCO-2001, pages 543-550, San Francisco, CA, 2001. Morgan Kaufmann Publishers.
12. P. Spirtes, C. Glymour, and R. Scheines. Causation, Prediction and search. Lecture Notes in Statistics. Springer-Verlag, New York, 1993.