Empirical investigation of size-based tournaments for node selection in genetic programming

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

  author =       "Thomas Helmuth and Lee Spector",
  title =        "Empirical investigation of size-based tournaments for
                 node selection in genetic programming",
  booktitle =    "GECCO Companion '12: Proceedings of the fourteenth
                 international conference on Genetic and evolutionary
                 computation conference companion",
  year =         "2012",
  editor =       "Terry Soule and Anne Auger and Jason Moore and 
                 David Pelta and Christine Solnon and Mike Preuss and 
                 Alan Dorin and Yew-Soon Ong and Christian Blum and 
                 Dario Landa Silva and Frank Neumann and Tina Yu and 
                 Aniko Ekart and Will Browne and Tim Kovacs and 
                 Man-Leung Wong and Clara Pizzuti and Jon Rowe and Tobias Friedrich and 
                 Giovanni Squillero and Nicolas Bredeche and 
                 Stephen L. Smith and Alison Motsinger-Reif and Jose Lozano and 
                 Martin Pelikan and Silja Meyer-Nienberg and 
                 Christian Igel and Greg Hornby and Rene Doursat and 
                 Steve Gustafson and Gustavo Olague and Shin Yoo and 
                 John Clark and Gabriela Ochoa and Gisele Pappa and 
                 Fernando Lobo and Daniel Tauritz and Jurgen Branke and 
                 Kalyanmoy Deb",
  isbn13 =       "978-1-4503-1178-6",
  keywords =     "genetic algorithms, Genetic programming: Poster",
  pages =        "1485--1486",
  month =        "7-11 " # jul,
  organisation = "SIGEVO",
  address =      "Philadelphia, Pennsylvania, USA",
  DOI =          "doi:10.1145/2330784.2331004",
  publisher =    "ACM",
  publisher_address = "New York, NY, USA",
  abstract =     "In genetic programming systems, genetic operators must
                 select nodes upon which to act; the method by which
                 they select nodes influences problem solving
                 performance and possibly also code growth. A recently
                 proposed node selection method using size-based
                 tournaments has been shown to have potential, but
                 variations of the method have not been studied
                 systematically. Here we extend the ideas of size-based
                 tournaments and test how they can improve
                 problem-solving performance. We consider allowing
                 tournament size to depend on whether we are selecting
                 nodes within donors for crossover, recipients for
                 crossover, or targets of mutation. We also consider
                 tournaments that bias selection toward smaller trees
                 rather than larger trees. We find that differentiating
                 between donors and recipients is probably not
                 worthwhile and that size 2 tournaments perform
  notes =        "Also known as \cite{2331004} Distributed at

                 ACM Order Number 910122.",

Genetic Programming entries for Thomas Helmuth Lee Spector