%0 Book Section %1 kinnear:siegel %A Siegel, Eric V. %B Advances in Genetic Programming %D 1994 %E Kinnear, Jr., Kenneth E. %I MIT Press %K algorithms, co-evolution genetic programming, %P 409--423 %T Competitively Evolving Decision Trees Against Fixed Training Cases for Natural Language Processing %U http://cognet.mit.edu/library/books/view?isbn=0262111888 %X Competitive fitness functions can generate performance superior to absolute fitness functions Angeline and Pollack 1993, Hillis 1992. This chapter describes a method by which competition can be implemented when training over a fixed (static) set of examples. Since new training cases cannot be generated by mutation or crossover, the probabilistic frequencies by which individual training cases are selected competitively adapt. We evolve decision trees for the problem of word sense disambiguation. The decision trees contain embedded bit strings; bit string crossover is intermingled with subtree-swapping. To approach the problem of overlearning, we have implemented a fitness penalty function specialized for decision trees which is dependent on the partition of the set of training cases implied by a decision tree. %& 19

@incollection{kinnear:siegel, abstract = {Competitive fitness functions can generate performance superior to absolute fitness functions [Angeline and Pollack 1993], [Hillis 1992]. This chapter describes a method by which competition can be implemented when training over a fixed (static) set of examples. Since new training cases cannot be generated by mutation or crossover, the probabilistic frequencies by which individual training cases are selected competitively adapt. We evolve decision trees for the problem of word sense disambiguation. The decision trees contain embedded bit strings; bit string crossover is intermingled with subtree-swapping. To approach the problem of overlearning, we have implemented a fitness penalty function specialized for decision trees which is dependent on the partition of the set of training cases implied by a decision tree.}, added-at = {2008-06-19T17:46:40.000+0200}, author = {Siegel, Eric V.}, biburl = {https://www.bibsonomy.org/bibtex/22e68af462a8b4a8c94b04b4d46f237c0/brazovayeye}, booktitle = {Advances in Genetic Programming}, chapter = 19, editor = {{Kinnear, Jr.}, Kenneth E.}, interhash = {a0eaad89d0d42911bd8d73d864350c77}, intrahash = {2e68af462a8b4a8c94b04b4d46f237c0}, keywords = {algorithms, co-evolution genetic programming,}, notes = {Not a GP but uses a mixture of strings and trees as an interpretable data structure for making a single choice from two alternatives. Gives training cases a fitness and choices by tournament the most difficult tests. arbitrary restriction on tree to prevent learning test cases rather than general principles. See also \cite{siegel2}}, pages = {409--423}, publisher = {MIT Press}, size = {15 pages}, timestamp = {2008-06-19T17:51:40.000+0200}, title = {Competitively Evolving Decision Trees Against Fixed Training Cases for Natural Language Processing}, url = {http://cognet.mit.edu/library/books/view?isbn=0262111888}, year = 1994 }