Created by W.Langdon from gp-bibliography.bib Revision:1.6970
A rooted-tree schema is a simple relation on the space of tree-shaped structures which provides a quantifiable partitioning of the search space. Formal manipulation of rooted-tree schemata allows: (1) The role of the size in the selection and survival of evolved expressions to be made explicit; (2) The interrelationship between parsimony penalty, size, and fitness of evolved expressions to be clarified and better understood; (3) The introduction of alternative approaches to evolving parsimonious solutions by preventing rooted-tree schema from bloating.
The rooted-tree schema concept provides a top-down perspective of how program expressions are evolved, contrary to the common belief that small pieces of code, or building blocks, are gradually assembled to create solutions. Analysis shows that GP, while it improves solutions, combines both bottom-up and top-down refinement strategies.",
Genetic Programming entries for Justinian Rosca Dana H Ballard