Evolutionary Computation · 2004 · 55 citations · 14 references
ArchitectureEvolutionary BiologyDesign OptimizationEvolutionary TheoryOptimizationEvolutionary ComputationEvolutionary OptimizationGenetic AlgorithmsGenetic ProgrammingPopulation-based SearchEvolutionary AlgorithmsEvolutionary SearchGenetic Algorithms For SearchPopulation-based OptimizationSubset Selection
A large training set of fitness cases can critically slow down genetic programming, if no appropriate subset selection method is applied. Such a method allows an individual to be evaluated on a smaller subset of fitness cases. In this paper we suggest a new subset selection method that takes the problem structure into account, while being problem independent at the same time. In order to achieve this, information about the problem structure is acquired during evolutionary search by creating a topology (relationship) on the set of fitness cases. The topology is induced by individuals of the evolving population. This is done by increasing the strength of the relation between two fitness cases, if an individual of the population is able to solve both of them. Our new topology-based subset selection method chooses a subset, such that fitness cases in this subset are as distantly related as is possible with respect to the induced topology. We compare topology-based selection of fitness cases with dynamic subset selection and stochastic subset sampling on four different problems. On average, runs with topology-based selection show faster progress than the others.
14
UCI Repository of machine learning databases
Catherine Blake · Medical Entomology and Zoology · 1998 · 10.5K citations
Binary codes capable of correcting deletions, insertions and reversals
V.I. Levenshtein · Soviet physics. Doklady · 1965 · 10.4K citations
Journal of the Optical Society of America · 1961 · 2.3K citations
PERSPECTIVE: COMPLEX ADAPTATIONS AND THE EVOLUTION OF EVOLVABILITY
Günter P. Wagner, Lee Altenberg · Evolution · 1996 · 1.6K citations · Full text