@inproceedings{eurogp07:smart,
title = {Empirical Analysis of {GP} Tree-Fragments},
address = {Valencia, Spain},
author = {Will Smart and Peter Andreae and Mengjie Zhang},
booktitle = {Proceedings of the 10th European Conference on Genetic
Programming},
editor = {Marc Ebner and Michael O'Neill and Anik\'o Ek\'art and Leonardo Vanneschi and Anna Isabel Esparcia-Alc\'azar},
month = {11 - 13 April},
pages = {55--67},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {4445},
year = {2007},
abstract = {Researchers have attempted to explain the power of
Genetic Programming (GP) search using various notions
of schema. However empirical studies of schemas have
been limited due to their vast numbers in typical
populations. This paper addresses the problem of
analysing schemas represented by tree-fragments. It
describes a new efficient way of representing the huge
sets of fragments in a population of GP programs and
presents an algorithm to find all fragments using this
efficient representation. Using this algorithm, the
paper presents an initial analysis of fragments in
populations of up to 300 programs, each up to seven
nodes deep. The analysis demonstrates a surprisingly
large variation in the numbers of fragments through
evolution and a non-monotonic rise in the most useful
fragments. With his method, empirical investigation of
the GP building block hypothesis and schema theory in
realistic sized GP systems becomes possible.},
isbn = {3-540-71602-5}, isbn13 = {978-3-540-71602-0}, notes = {Part of \cite{ebner:2007:GP} EuroGP'2007 held in
conjunction with EvoCOP2007, EvoBIO2007 and
EvoWorkshops2007}, doi = {doi:10.1007/978-3-540-71605-1_6},
keywords = {algorithms, genetic programming }
}
::