On the constructiveness of context-aware crossover

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

@InProceedings{1277286,

• author = "Hammad Majeed and Conor Ryan",
• title = "On the constructiveness of context-aware crossover",
• 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 = "1659--1666",
• address = "London",
• URL = "http://gpbib.cs.ucl.ac.uk/gecco2007/docs/p1659.pdf",
• DOI = "doi:10.1145/1276958.1277286",
• publisher = "ACM Press",
• publisher_address = "New York, NY, USA",
• month = "7-11 " # jul,
• organisation = "ACM SIGEVO (formerly ISGEC)",
• keywords = "genetic algorithms, genetic programming, cache, constructive, context, context aware crossover, crossover, fitness",
• abstract = "Crossover in Genetic Programming is mostly a destructive operator, generally producing children worse than the parents and occasionally producing those who are better. A recently introduced operator, Context-Aware Crossover, which implicitly discovers the best possible crossover site for a subtree has been shown to consistently attain higher fitnesses while processing fewer individuals.

  It has been observed that context-aware crossover is similar to Brood Crossover in that multiple children are produced during each crossover event. This paper performs a thorough analysis of these crossover operators and compares the performance of the two and demonstrates that, although they do work similarly, context-aware crossover performs a far better sampling of the search space and thus performs much better.

  We also demonstrate that context-aware crossover benefits from a speed up of almost an order of magnitude when using a simple and very small cache, which is over two orders of magnitude smaller than caches typically used.",

• 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