From recombination of genes to the estimation of distributions I. Binary parameters

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1141, Issue , 1996, Pages 178-187

  Muhlenbein H ^a   Paass G ^a  

^a FRAUNHOFER INSTITUTE FOR APPLIED INFORMATION TECHNOLOGY FIT   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; EVOLUTIONARY ALGORITHMS; GENES; GENETIC ALGORITHMS;

BINARY PARAMETERS; BREEDER GENETIC ALGORITHM; ESTIMATION OF DISTRIBUTIONS; GENE POOLS; MARGINAL DISTRIBUTION ALGORITHMS; RESPONSE TO SELECTION; SEXUAL RECOMBINATION;

PROBLEM SOLVING;

EID: 84958959530     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61723-X_982     Document Type: Conference Paper

References (18)

1. H. Asoh and H. Miihlenbein. Estimating the heritability by decomposing the genetic variance. In Y. Davidor, H.-P. Schwefel, and R. Ms editors, Parallel Problem Solving from Nature, Lecture Notes in Computer Science 866, pages 98-107. Springer-Verlag, 1994.
2. S. Baluja and R. Caruana. Removing the genetics from the standard genetic algorithm. In Proc. of the 1Pth Intern. Conf. on Machine Learning, Lake Tahoe, 1995.
3. J. Besag. Spatial interaction and the statistical analysis of lattice systems. J. Royal Statistical Society, Series B, pages 192-236, 1974.
4. L. Breiman, J.H. Friedman, R. Olshen, and C.J. Stone. Classification and Regression Trees. Wadsworth International Group, Belmont, California, 1984.
5. W. Buntine. Learning classification trees. Statistics and Computing, 2:63-73, 1992.
6. J.F. Crow and M. Kimura. An Introduction to Population Genetics Theory. Harper and Row, New York, 1970.
7. D. S. Falconer. Introduction to Quantitative Genetics. Longman, London, 1981.
8. R. A. Fisher. The Genetical Theory of Natural Selection. Dover, New York, 1958.
9. D.E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading, 1989.
10. D.E. Goldberg, K. Deb, H. Kargupta, and G. Harik. Rapid, accurate optimization of difficult problems using fast messy genetic algorithms. In S. Forrest, editor, Proc. of the Fith Int. Conf. on Genetic Algorithms, pages 56-64, San Mateo, 1993. Morgan-Kaufman.
11. V. Kvasnicka, M. Pelikan, and J. Pospichal. Hill-climbing with learning: An abstraction of genetic algorithm. Technical report, Slovak Technical University, Bratislava, 1995.
12. H. Miihlenbein and D. Schlierkamp-Voosen. The science of breeding and its application to the breeder genetic algorithm. Evolutionary Computation, 1:335-360, 1994.
13. H. Miihlenbein and H.-M. Voigt. Gene pool recombination in genetic algorithms. In J.P. Kelly and I.H Osman, editors, Metaheuristics: Theory and Applications, Norwell, 1996. Kluwer Academic Publisher.
14. K.V.S. Murthy. On Growing Better Decision Trees from Data. PhD thesis, The John Hopkins University, Baltimore, Maryland, 1995.
15. T. Naglyaki. Introduction to Theoretical Population Genetics. Springer, Berlin, 1992.
16. R.B. Robbins. Some applications of mathematics to breeding problems iii. Genetics, 3:375-389, 1918.
17. J.N. Sonquist and J.N. Morgan. The Detection of Interaction Effects, volume Monograph 35. Survey Research Center, Institute for Social Research, University of Michigan, 1964.
18. G. Syswerda. Uniform crossover in genetic algorithms. In H. Schaffer, editor, 3rd Int. Conf. on Genetic Algorithms, pages 2-9, San Mateo, 1989. Morgan Kanfmann.