Estimating the distribution and propagation of genetic programming building blocks through tree compression

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

  author =       "Robert I. McKay and Xuan Hoai Nguyen and 
                 James R. Cheney and MinHyeok Kim and Naoki Mori and 
                 Tuan Hao Hoang",
  title =        "Estimating the distribution and propagation of genetic
                 programming building blocks through tree compression",
  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 =        "1011--1018",
  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.1570038",
  abstract =     "Shin et al [19] and McKay et al [15] previously
                 applied tree compression and semantics-based
                 simplification to study the distribution of building
                 blocks in evolving Genetic Programming populations.
                 However their method could only give static estimates
                 of the degree of repetition of building blocks in one
                 generation at a time, supplying no information about
                 the flow of building blocks between generations. Here,
                 we use a state-of-the-art tree compression algorithm,
                 xmlppm, to estimate the extent to which frequent
                 building blocks from one generation are still in use in
                 a later generation.

                 While they compared the behaviour of different GP
                 algorithms on one specific problem -- a simple symbolic
                 regression problem -- we extend the analysis to a more
                 complex problem, a symbolic regression problem to find
                 a Fourier approximation to a sawtooth wave, and to a
                 Boolean domain, odd parity.",
  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 R I (Bob) McKay Nguyen Xuan Hoai James R Cheney MinHyeok Kim Naoki Mori Tuan-Hao Hoang