Phenotypical Building Blocks for Genetic Programming   [BB] [GP]

by

Haynes, T.

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: Genetic Algorithms: Proceedings of the Seventh International Conference (Conference proceedings), 1997, p. 26-33
Keywords:Genetic Programming, Genetic Algorithms
Abstract:
The theoretical foundations of genetic algorithms (GA) [GA] [GAG] rest on the shoulders of the Schema Theorem, [ST] which states that the building blocks, [BB] highly fit compact subsets of the chromosome, are more likely to survive from one generation to the next. The theory of genetic programming (GP) [GP] is tenuous, borrowing heavily from that of GA. As the GP can be considered to be a GA operating on a tree structure, this borrowing is adequate for most. Part of the problem of tying GP theory to [GT] the schema theorem [ST] is in the identification of building blocks. [BB] We discuss how a building block [BB] can be represented in a GP chromosome and the characteristics of building blocks [BB] in GP chromosomes. We also present the clique detection domain for which the detection of building blocks [BB] is easier than in previous domains utilized in GP research. We illustrate how the clique detection domain facilitates the construction of fitness landscapes similar to [FL] those of the Royal Road functions [RR] [RRF] in GA research.
Notes:
ICGA-97
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{haynes:1997:pbbGP,
  author =       "Thomas Haynes",
  title =        "Phenotypical Building Blocks for Genetic Programming",
  booktitle =    "Genetic Algorithms: Proceedings of the Seventh
                 International Conference",
  year =         "1997",
  editor =       "Thomas Back",
  pages =        "26--33",
  address =      "Michigan State University, East Lansing, MI, USA",
  publisher_address = "San Francisco, CA, USA",
  month =        "19-23 " # jul,
  publisher =    "Morgan Kaufmann",
  keywords =     "Genetic Programming, Genetic Algorithms",
  ISBN =         "1-55860-487-1",
  size =         "8 pages",
  abstract =     "The theoretical foundations of genetic algorithms (GA)
                 rest on the shoulders of the Schema Theorem, which
                 states that the building blocks, highly fit compact
                 subsets of the chromosome, are more likely to survive
                 from one generation to the next. The theory of genetic
                 programming (GP) is tenuous, borrowing heavily from
                 that of GA. As the GP can be considered to be a GA
                 operating on a tree structure, this borrowing is
                 adequate for most. Part of the problem of tying GP
                 theory to the schema theorem is in the identification
                 of building blocks. We discuss how a building block can
                 be represented in a GP chromosome and the
                 characteristics of building blocks in GP chromosomes.
                 We also present the clique detection domain for which
                 the detection of building blocks is easier than in
                 previous domains utilized in GP research. We illustrate
                 how the clique detection domain facilitates the
                 construction of fitness landscapes similar to those of
                 the Royal Road functions in GA research.",
  notes =        "ICGA-97",
}