Context-aware mutation: a modular, context aware mutation operator for genetic programming

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

@InProceedings{1277285,
  author =       "Hammad Majeed and Conor Ryan",
  title =        "Context-aware mutation: a modular, context aware
                 mutation operator for genetic programming",
  booktitle =    "GECCO '07: Proceedings of the 9th annual conference on
                 Genetic and evolutionary computation",
  year =         "2007",
  editor =       "Dirk Thierens and Hans-Georg Beyer and 
                 Josh Bongard and Jurgen Branke and John Andrew Clark and 
                 Dave Cliff and Clare Bates Congdon and Kalyanmoy Deb and 
                 Benjamin Doerr and Tim Kovacs and Sanjeev Kumar and 
                 Julian F. Miller and Jason Moore and Frank Neumann and 
                 Martin Pelikan and Riccardo Poli and Kumara Sastry and 
                 Kenneth Owen Stanley and Thomas Stutzle and 
                 Richard A Watson and Ingo Wegener",
  volume =       "2",
  isbn13 =       "978-1-59593-697-4",
  pages =        "1651--1658",
  address =      "London",
  URL =          "http://www.cs.bham.ac.uk/~wbl/biblio/gecco2007/docs/p1651.pdf",
  DOI =          "doi:10.1145/1276958.1277285",
  publisher =    "ACM Press",
  publisher_address = "New York, NY, USA",
  month =        "7-11 " # jul,
  organisation = "ACM SIGEVO (formerly ISGEC)",
  keywords =     "genetic algorithms, genetic programming, building
                 blocks, cache, constructive, context, context aware
                 crossover, crossover, fitness, modules",
  abstract =     "This paper introduces a new type of mutation,
                 Context-Aware Mutation, which is inspired by the
                 recently introduced context-aware crossover.
                 Context-Aware mutation operates by replacing existing
                 sub-trees with modules from a previously constructed
                 repository of possibly useful subtrees.

                 We describe an algorithmic way to produce the
                 repository from an initial, exploratory run and test
                 various GP set ups for producing the repository. The
                 results show that when the exploratory run uses
                 context-aware crossover and the main run uses
                 context-aware mutation, not only is the final result
                 significantly better, the overall cost of the runs in
                 terms of individuals evaluated is significantly
                 lower.",
  notes =        "GECCO-2007 A joint meeting of the sixteenth
                 international conference on genetic algorithms
                 (ICGA-2007) and the twelfth annual genetic programming
                 conference (GP-2007).

                 ACM Order Number 910071",
}

Genetic Programming entries for Hammad Majeed Conor Ryan

Citations