A Discussion on Generality and Robustness and a Framework for Fitness Set Construction in Genetic Programming to Promote Robustness

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

@InProceedings{Bersano-Begey:1997:grffc,

• author = "Tommaso F. Bersano-Begey and Jason M. Daida",
• title = "A Discussion on Generality and Robustness and a Framework for Fitness Set Construction in Genetic Programming to Promote Robustness",
• booktitle = "Late Breaking Papers at the 1997 Genetic Programming Conference",
• year = "1997",
• editor = "John R. Koza",
• pages = "11--18",
• address = "Stanford University, CA, USA",
• publisher_address = "Stanford University, Stanford, California, 94305-3079, USA",
• month = "13--16 " # jul,
• publisher = "Stanford Bookstore",
• keywords = "genetic algorithms, genetic programming",
• ISBN = "0-18-206995-8",
• notes = "GP-97LB The email address for the bookstore for mail orders is mailorder@bookstore.stanford.edu Phone no 415-329-1217 or 800-533-2670

  Fri, 05 Sep 1997 06:14:54 EDT I did some follow-up work in trying to improve generality of code in the wall-following problem, and started to look at how to gain more information about generality by recording the distribution of hits (rather than just their total), an iterative algorithm to check for and correct ambiguous training sets (one which can be solved by other solutions besides the correct one), and an account of the relationship between size and generality of solutions. The following was a very preliminary work, but I am now working on expanding each topic and writing them in a more formal way.

  slides http://www-personal.umich.edu/~tombb/gp973/",

}

Genetic Programming entries for Tommaso F Bersano-Begey Jason M Daida

Citations