Probabilistic Model Building and Competent Genetic Programming

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

@InCollection{sastry:2003:GPTP13,
  author =       "Kumara Sastry and David E. Goldberg",
  title =        "Probabilistic Model Building and Competent Genetic
                 Programming",
  booktitle =    "Genetic Programming Theory and Practice",
  publisher =    "Kluwer",
  year =         "2003",
  editor =       "Rick L. Riolo and Bill Worzel",
  chapter =      "13",
  pages =        "205--220",
  keywords =     "genetic algorithms, genetic programming, Competent
                 genetic program, Linkage adaptation, Linkage learning,
                 Probabilistic model building, Extended compact genetic
                 algorithm",
  ISBN =         "1-4020-7581-2",
  URL =          "http://gal31.ge.uiuc.edu/kumara/wp-content/files/2003013.pdf",
  abstract =     "a probabilistic model building genetic programming
                 (PMBGP) developed based on the extended compact genetic
                 algorithm (eCGA). Unlike traditional genetic
                 programming, which use fixed recombination operators,
                 the proposed PMBGA adapts linkages. The proposed
                 algorithms, called the extended compact genetic
                 programming (eCGP) adaptively identifies and exchanges
                 non-overlapping building blocks by constructing and
                 sampling probabilistic models of promising solutions.
                 The results show that eCGP scales-up polynomially with
                 the problem size (the number of functionals and
                 terminals) on both GP-easy problem and boundedly
                 difficult GP-hard problem.",
  notes =        "Part of \cite{RioloWorzel:2003}",
  size =         "14 pages",
}

Genetic Programming entries for Kumara Sastry David E Goldberg