Internal and online simplification in genetic programming: an experimental comparison

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

  title =        "Internal and online simplification in genetic
                 programming: an experimental comparison",
  author =       "Yaroslav Borcheninov and Yuri Okulovsky",
  booktitle =    "Proceedings of the Spring/Summer Young Researchers'
                 Colloquium on Software Engineering",
  year =         "2012",
  editor =       "Alexander S. Kamkin and Alexander K. Petrenko and 
                 Andrey N. Terekhov",
  volume =       "6",
  pages =        "134--138",
  address =      "Perm, Russia",
  month =        may,
  organisation = "Institute for System Programming of the Russian
                 Academy of Sciences (ISPRAS) and Saint-Petersburg State
                 University (SPbSU) jointly with NRU HSE",
  keywords =     "genetic algorithms, genetic programming, symbolic
                 computations, computer algebra systems",
  isbn13 =       "978-5-91474-019-8",
  annote =       "The Pennsylvania State University CiteSeerX Archives",
  bibsource =    "OAI-PMH server at",
  language =     "en",
  oai =          "oai:CiteSeerX.psu:",
  rights =       "Metadata may be used without restrictions as long as
                 the oai identifier remains attached to it.",
  URL =          "",
  URL =          "",
  URL =          "",
  DOI =          "doi:10.15514/SYRCOSE-2012-6-22",
  size =         "5 pages",
  abstract =     "Genetic programming is an evolutionary algorithm,
                 which allows performing symbolic regression --- the
                 important task of obtaining the analytical form of a
                 model by the data, produced by the model. One of the
                 known problems of genetic programming is expressions
                 bloating that results in ineffectively long
                 expressions. To prevent bloating, symbolic
                 simplification of expression is used. We introduce a
                 new approach to simplification in genetic programming,
                 making it a uniform part of the evolutionary process.
                 To do that, we develop a genetic programming on the
                 basis of transformation rules, similarly to computer
                 algebra systems. We compare our approach with existed
                 solution, and prove its adequacy and effectiveness.",
  notes =        "Ural Federal University, Yekaterinburg, Lenina str.

Genetic Programming entries for Yaroslav V Borcheninov Yuri S Okulovsky