Numeric Mutation Improves the Discovery of Numeric Constants in Genetic Programming

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

@InProceedings{evett:1998:nmidncGP,
  author =       "Matthew Evett and Thomas Fernandez",
  title =        "Numeric Mutation Improves the Discovery of Numeric
                 Constants in Genetic Programming",
  booktitle =    "Genetic Programming 1998: Proceedings of the Third
                 Annual Conference",
  year =         "1998",
  editor =       "John R. Koza and Wolfgang Banzhaf and 
                 Kumar Chellapilla and Kalyanmoy Deb and Marco Dorigo and 
                 David B. Fogel and Max H. Garzon and 
                 David E. Goldberg and Hitoshi Iba and Rick Riolo",
  pages =        "66--71",
  address =      "University of Wisconsin, Madison, Wisconsin, USA",
  publisher_address = "San Francisco, CA, USA",
  month =        "22-25 " # jul,
  publisher =    "Morgan Kaufmann",
  keywords =     "genetic algorithms, genetic programming",
  ISBN =         "1-55860-548-7",
  URL =          "http://www.emunix.emich.edu/~evett/Publications/gp98-nm.pdf",
  size =         "6 pages",
  abstract =     "Genetic programming suffers difficulty in discovering
                 useful numeric constants for the terminal nodes of its
                 sexpression trees. In earlier work we postulated a
                 solution to this problem called numeric mutation. Here,
                 we provide empirical evidence to demonstrate that this
                 method provides a statistically significant improvement
                 in GP system performance on a variety of problems.",
  notes =        "GP-98",
}

Genetic Programming entries for Matthew P Evett Thomas Fernandez

Citations