From recombination of genes to the estimation of distributions I. Binary parameters
Lecture notes in computer sciencePublished 1 January 1996
Heinz Mühlenbein, Gerhard Paaß
Citations1,202
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The problem is the problem and several modifications of sexual recombination are investigated, which leads to marginal distribution algorithms, which lead to more sophisticated methods, based on estimating the distribution of promising points.
Abstract
S.178-187
Keywords
Computer ScienceBiochemistry, Genetics and Molecular Biology
Choice Reviews OnlineGenetic algorithms in search, optimization, and machine learning
49,278 Citations1989
This book brings together the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields.
BiometricsIntroduction to Quantitative Genetics.
21,752 Citations1982A. W. F. Edwards, D. S. Falconer
Genetic Algorithms in Search, Optimization and Machine Learning
17,773 Citations1988David E. Goldberg, David Robson
Clarendon Press eBooksThe genetical theory of natural selection
17,589 Citations1930Ronald Aylmer Fisher
Journal of the Royal Statistical Society Series B (Statistical Methodology)Spatial Interaction and the Statistical Analysis of Lattice Systems
6,179 Citations1974Julian Besag
An introduction to population genetics theory
4,048 Citations1970James F. Crow, Makoto Kimura
Elsevier eBooksRemoving the Genetics from the Standard Genetic Algorithm
577 Citations1995Shumeet Baluja, Rich Caruana
An abstraction of the genetic algorithm, termed population-based incremental learning (PBIL), that explicitly maintains the statistics contained in a GA''s population, but which abstracts away the crossover operator and redefines the role of the population results in PBIL being simpler, both computationally and theoretically, than the GA.
Statistics and ComputingLearning classification trees
395 Citations1992Wray Buntine
This paper introduces Bayesian techniques for splitting, smoothing, and tree averaging, which are similar to Quinlan's information gain, while smoothing and averaging replace pruning.
Journal of the Operational Research SocietyMeta-Heuristics Theory and Applications
379 Citations1997Ibrahim H. Osman, J P Kelly
This volume is drawn from the first conference on Meta-Heuristics and contains 41 papers on the state-of-the-art in heuristic theory and applications.
BiomathematicsIntroduction to Theoretical Population Genetics
342 Citations1992Thomas Nagylaki
Asexual Haploid Populations, Inbreeding and Random Drift, and The Island Model: The Decomposition of the Variance with Panmixia.
RapidAccurate Optimization of Difficult Problems Using Fast Messy Genetic Algorithms
325 Citations1993David E. Goldberg, Kalyanmoy Deb +2 more
Evolutionary ComputationThe Science of Breeding and Its Application to the Breeder Genetic Algorithm (BGA)
244 Citations1993Heinz Mühlenbein, Dirk Schlierkamp-Voosen
It is shown how the response to selection equation and the concept of heritability can be applied to predict the behavior of the BGA and it is shown that recombination and mutation are complementary search operators.
On growing better decision trees from data
112 Citations1996Steven L. Salzberg, Kolluru Venkata Sreerama Murthy
Two forms of data massaging, domain-independent and domain-specific, are distinguished and a new framework is outlined for the former, and the importance of the latter is illustrated in the context of two new, complex classification problems in astronomy.
MetaheuristicsGene Pool Recombination in Genetic Algorithms
89 Citations1996Heinz Mühlenbein, Hans-Michael Voigt
In GPR, the genes are randomly picked from the gene pool defined by the selected parents, and the mathematical analysis shows that a genetic algorithm with only selection and recombination is not a global optimization method, in contrast to popular belief.
Lecture notes in computer scienceEstimating the heritability by decomposing the genetic variance
13 Citations1994Hideki Asoh, Heinz Mühlenbein
A fundamental theorem is proven which allows estimation of the heritability from microscopic genetic information of the population and how the theorem can be used in the breeder genetic algorithm BGA.