Hierarchical automatic function definition in genetic programming

Created by W.Langdon from gp-bibliography.bib Revision:1.4420

  author =       "John R. Koza",
  title =        "Hierarchical automatic function definition in genetic
  booktitle =    "Foundations of Genetic Algorithms 2",
  editor =       "L. Darrell Whitley",
  publisher =    "Morgan Kaufmann",
  year =         "1992",
  pages =        "297--318",
  address =      "Vail, Colorado, USA",
  month =        "24--29 " # jul,
  keywords =     "genetic algorithms, genetic programming",
  notes =        "FOGA-2",
  URL =          "http://www.genetic-programming.com/jkpdf/foga1992.pdf",
  abstract =     "A key goal in machine learning and artificial
                 intelligence is to automatically and dynamically
                 decompose problems into simpler problems in order to
                 facilitate their solution. This paper describes two
                 extensions to genetic programming, called
                 {"}automatic{"} function definition and {"}hierarchical
                 automatic{"} function definition, wherein functions
                 that might be useful in solving a problem are
                 automatically and dynamically defined during a run in
                 terms of dummy variables. The defined functions are
                 then repeatedly called from the automatically
                 discovered {"}main{"} result-producing part of the
                 program with different instantiations of the dummy
                 variables. In the {"}hierarchical{"} version of
                 automatic function definition, automatically defined
                 functions may call other automatically defined
                 functions, thus creating a hierarchy of dependencies
                 among the automatically defined functions. The
                 even-11-parity problem was solved using hierarchical
                 automatic function definition.",

Genetic Programming entries for John Koza