Extending Genetic Programming with Recombinative Guidance   [GP]

by

Iba, H., Garis, H., D. and Garis, H., .

Literature search on Evolutionary ComputationBBase ©1999-2013, Rasmus K. Ursem
     Home · Search · Adv. search · Authors · Login · Add entries   Webmaster
Note to authors: Please submit your bibliography and contact information - online papers are more frequently cited.

Info: Advances in Genetic Programming 2, 1996, p. 69-88
Keywords:genetic algorithms, genetic programming
Abstract:
This chapter introduces a recombinative guidance mechanism for GP (Genetic Programming), [GP] and shows the effectiveness of our approach using various experiments. Traditional GP blindly combines subtrees, by applying crossover operations. This blind replacement, in general, can often disrupt beneficial building-blocks in tree structures. Randomly chosen crossover points ignore the semantics of the parent trees. Our goal is to exploit already built structures by adaptive recombination, in which GP recombination is guided by ``S-value'' measures. We present various S-value definitions, and show that the performance depends upon the definition.
Internet search:Search Google
Search Google Scholar
Search Citeseer using Google
Search Google for PDF
Search Google Scholar for PDF
Search Citeseer for PDF using Google

Review item:

Mark as doublet (will be reviewed)

Print entry




BibTex:
@InCollection{iba:1996:aigp2,
  author =       "Hitoshi Iba and Hugo {de Garis}",
  title =        "Extending Genetic Programming with Recombinative
                 Guidance",
  booktitle =    "Advances in Genetic Programming 2",
  publisher =    "MIT Press",
  year =         "1996",
  editor =       "Peter J. Angeline and K. E. {Kinnear, Jr.}",
  pages =        "69--88",
  chapter =      "4",
  address =      "Cambridge, MA, USA",
  keywords =     "genetic algorithms, genetic programming",
  ISBN =         "0-262-01158-1",
  abstract =     "This chapter introduces a recombinative guidance
                 mechanism for GP (Genetic Programming), and shows the
                 effectiveness of our approach using various
                 experiments. Traditional GP blindly combines subtrees,
                 by applying crossover operations. This blind
                 replacement, in general, can often disrupt beneficial
                 building-blocks in tree structures. Randomly chosen
                 crossover points ignore the semantics of the parent
                 trees. Our goal is to exploit already built structures
                 by adaptive recombination, in which GP recombination is
                 guided by ``S-value'' measures. We present various
                 S-value definitions, and show that the performance
                 depends upon the definition.",
}