Langdon, W.B.;
Banzhaf, W.;
(2005)
Repeated patterns in tree genetic programming.
In: Keijzer, M. and Tettamanzi, A. and Collet, P., (eds.)
Genetic Programming: 8th European Conference, EuroGP 2005, Lausanne, Switzerland, March 30 - April 1, 2005. Proceedings.
(pp. pp. 190-202).
Springer-Verlag GmbH
![[thumbnail of wbl_repeated_tree.pdf]](https://discovery.ucl.ac.uk/style/images/fileicons/application_pdf.png) Preview |
PDF
wbl_repeated_tree.pdf Download (694kB) |
Abstract
We extend our analysis of repetitive patterns found in genetic programming genomes to tree based GP. As in linear GP, repetitive patterns are present in large numbers. Size fair crossover limits bloat in automatic programming, preventing the evolution of recurring motifs. We examine these complex properties in detail: e.g. using depth v. size Catalan binary tree shape plots, subgraph and subtree matching, information entropy, syntactic and semantic fitness correlations and diffuse introns. We relate this emergent phenomenon to considerations about building blocks in GP and how GP works.
| Type: | Proceedings paper |
|---|---|
| Title: | Repeated patterns in tree genetic programming |
| ISBN: | 3540254366 |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1007/b107383 |
| Publisher version: | http://www.springerlink.com/openurl.asp?genre=arti... |
| Language: | English |
| Additional information: | The original publication is available at http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=3447&spage=190 |
| URI: | https://discovery.ucl.ac.uk/id/eprint/577 |
Archive Staff Only
 |
View Item |
