Challenges with Verification, Repeatability, and Meaningful Comparison in Genetic Programming: Gibson's Magic

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

@InProceedings{daida:1999:CVRMCGPGM,

• author = "Jason M. Daida and Derrick S. Ampy and Michael Ratanasavetavadhana and Hsiaolei Li and Omar A. Chaudhri",
• title = "Challenges with Verification, Repeatability, and Meaningful Comparison in Genetic Programming: Gibson's Magic",
• booktitle = "Proceedings of the Genetic and Evolutionary Computation Conference",
• year = "1999",
• editor = "Wolfgang Banzhaf and Jason Daida and Agoston E. Eiben and Max H. Garzon and Vasant Honavar and Mark Jakiela and Robert E. Smith",
• volume = "2",
• pages = "1851--1858",
• address = "Orlando, Florida, USA",
• publisher_address = "San Francisco, CA 94104, USA",
• month = "13-17 " # jul,
• publisher = "Morgan Kaufmann",
• keywords = "genetic algorithms, genetic programming, methodology, pedagogy and philosophy",
• ISBN = "1-55860-611-4",
• URL = "ftp://ftp.eecs.umich.edu/people/daida/papers/GECCO99challenges.pdf",
• URL = "http://citeseer.ist.psu.edu/257412.html",
• URL = "http://gpbib.cs.ucl.ac.uk/gecco1999/MP-604.pdf",
• URL = "http://gpbib.cs.ucl.ac.uk/gecco1999/MP-604.ps",
• abstract = "This paper examines some of the reporting and research practices concerning empirical work in genetic programming. We describe several common loopholes and offer three case studies---two in data modeling and one in robotics---that illustrate each. We show that by exploiting these loopholes, one can achieve performance gains of up two orders of magnitude without any substantiative changes to GP. We subsequently offer several recommendations.",
• notes = "GECCO-99 A joint meeting of the eighth international conference on genetic algorithms (ICGA-99) and the fourth annual genetic programming conference (GP-99)",

}

Genetic Programming entries for Jason M Daida Derrick S Ampy Michael Ratanasavetavadhana Hsiaolei Li Omar A Chaudhri

Citations