Analysis of Complexity Drift in Genetic Programming

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

@InProceedings{Rosca:1997:cdGP,

• author = "Justinian P. Rosca",
• title = "Analysis of Complexity Drift in Genetic Programming",
• booktitle = "Genetic Programming 1997: Proceedings of the Second Annual Conference",
• editor = "John R. Koza and Kalyanmoy Deb and Marco Dorigo and David B. Fogel and Max Garzon and Hitoshi Iba and Rick L. Riolo",
• year = "1997",
• month = "13-16 " # jul,
• pages = "286--294",
• address = "Stanford University, CA, USA",
• publisher_address = "San Francisco, CA, USA",
• publisher = "Morgan Kaufmann",
• keywords = "genetic algorithms, genetic programming, schema theory",
• URL = "ftp://ftp.cs.rochester.edu/pub/u/rosca/gp/97.gp.ps.gz",
• size = "9 pages",
• abstract = "One serious problem of standard Genetic Programming (GP) is that evolved structures appear to drift towards large and slow forms on average. This paper presents a novel analysis of the role played by variable complexity in the selection and survival of GP expressions. It defines a particular property of GP representations, called rooted tree-schema, that sheds light on the role of variable complexity of evolved structures. A rooted tree-schema is a relation on the space of tree-shaped structures which provides a quantifiable partitioning of the search space. The paper analyzes the influence of parsimony pressure on selection and growth of structures. Experimental evidence confirms theoretical predictions.",
• notes = "GP-97",

}

Genetic Programming entries for Justinian Rosca

Citations