How online simplification affects building blocks in genetic programming

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

  author =       "David Kinzett and Mark Johnston and Mengjie Zhang",
  title =        "How online simplification affects building blocks in
                 genetic programming",
  booktitle =    "GECCO '09: Proceedings of the 11th Annual conference
                 on Genetic and evolutionary computation",
  year =         "2009",
  editor =       "Guenther Raidl and Franz Rothlauf and 
                 Giovanni Squillero and Rolf Drechsler and Thomas Stuetzle and 
                 Mauro Birattari and Clare Bates Congdon and 
                 Martin Middendorf and Christian Blum and Carlos Cotta and 
                 Peter Bosman and Joern Grahl and Joshua Knowles and 
                 David Corne and Hans-Georg Beyer and Ken Stanley and 
                 Julian F. Miller and Jano {van Hemert} and 
                 Tom Lenaerts and Marc Ebner and Jaume Bacardit and 
                 Michael O'Neill and Massimiliano {Di Penta} and Benjamin Doerr and 
                 Thomas Jansen and Riccardo Poli and Enrique Alba",
  pages =        "979--986",
  address =      "Montreal",
  publisher =    "ACM",
  publisher_address = "New York, NY, USA",
  month =        "8-12 " # jul,
  organisation = "SigEvo",
  keywords =     "genetic algorithms, genetic programming",
  isbn13 =       "978-1-60558-325-9",
  bibsource =    "DBLP,",
  DOI =          "doi:10.1145/1569901.1570035",
  abstract =     "This paper investigates the effect on building blocks
                 during evolution of two online program simplification
                 methods in genetic programming. The two simplification
                 methods considered are algebraic simplification and
                 numerical simplification. The building blocks
                 considered are of a more general form (two and three
                 level subtrees) than numeric constants only. Unlike
                 most of the existing work which often uses simple
                 symbolic regression tasks, this work considers
                 classification tasks as examples. We develop a new
                 method for encoding possible building blocks for the
                 analysis. The results show that the two online program
                 simplification methods can generate new diverse
                 building blocks during evolution although they also
                 destroy existing ones and that many of the existing
                 building blocks are retained during evolution. Compared
                 with the canonical genetic programming method, the two
                 simplification methods can generate much smaller
                 programs, use much shorter evolutionary training time
                 and achieve comparable effectiveness performance.",
  notes =        "GECCO-2009 A joint meeting of the eighteenth
                 international conference on genetic algorithms
                 (ICGA-2009) and the fourteenth annual genetic
                 programming conference (GP-2009).

                 ACM Order Number 910092.",

Genetic Programming entries for David Kinzett Mark Johnston Mengjie Zhang