Complexity-based Fitness Evaluation for Variable Length Representation

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

@Unpublished{iba:1997:cfevlr,
  author =       "Hitoshi Iba",
  title =        "Complexity-based Fitness Evaluation for Variable
                 Length Representation",
  note =         "Position paper at the Workshop on Evolutionary
                 Computation with Variable Size Representation at
                 ICGA-97",
  month =        "20 " # jul,
  year =         "1997",
  address =      "East Lansing, MI, USA",
  keywords =     "genetic algorithms, genetic programming, bloat,
                 variable size representation",
  URL =          "http://coblitz.codeen.org:3125/citeseer.ist.psu.edu/cache/papers/cs/16452/http:zSzzSzwww.miv.t.u-tokyo.ac.jpzSz~ibazSztmpzSzagp94.pdf/iba94genetic.pdf",
  URL =          "http://citeseer.ist.psu.edu/327857.html",
  abstract =     "This paper introduces a Minimum Description Length
                 (MDL) principle to define fitness functions in Genetic
                 Programming (GP). In traditional (Koza-style) GP, the
                 size of trees was usually controlled by user-defined
                 parameters, such as the maximum number of nodes and
                 maximum tree depth. Large tree sizes meant that the
                 time necessary to measure their fitnesses often
                 dominated total processing time. To overcome this
                 difficulty, we introduce a method for controlling tree
                 growth, which uses an...",
  size =         "3 pages",
}

Genetic Programming entries for Hitoshi Iba