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

by

Bersano-Begey, T., F. and Daida, J., M.

Literature search on Evolutionary ComputationBBase ©1999-2013, Rasmus K. Ursem
     Home · Search · Adv. search · Authors · Login · Add entries   Webmaster
Note to authors: Please submit your bibliography and contact information - online papers are more frequently cited.

Info: Late Breaking Papers at the 1997 Genetic Programming Conference (Conference proceedings), 1997, p. 11-18
Keywords:genetic algorithms, genetic programming
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/
Author(s) DL:Online papers for Bersano-Begey, T., F.
Internet search:Search Google
Search Google Scholar
Search Citeseer using Google
Search Google for PDF
Search Google Scholar for PDF
Search Citeseer for PDF using Google

Review item:

Mark as doublet (will be reviewed)

Print entry



BibTex:
@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/",
}