Created by W.Langdon from gp-bibliography.bib Revision:1.2031
@InProceedings{langdon:2005:eurogp,
author = "William B. Langdon and Wolfgang Banzhaf",
editor = "Maarten Keijzer and Andrea Tettamanzi and
Pierre Collet and Jano I. {van Hemert} and Marco Tomassini",
title = "Repeated Patterns in Tree Genetic Programming",
booktitle = "Proceedings of the 8th European Conference on Genetic
Programming",
publisher = "Springer",
series = "Lecture Notes in Computer Science",
volume = "3447",
year = "2005",
address = "Lausanne, Switzerland",
month = "30 " # mar # " - 1 " # apr,
organisation = "EvoNet",
keywords = "genetic algorithms, genetic programming, frequent
subtrees, frequent subgraphs",
ISBN = "3-540-25436-6",
pages = "190--202",
publisher_address = "Berlin",
URL = "
http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/wbl_egp2005.pdf",
URL = "
http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/wbl_egp2005.ps.gz",
URL = "
http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3447&spage=190",
bibsource = "DBLP, http://dblp.uni-trier.de",
doi = "
doi:10.1007/978-3-540-31989-4_17",
abstract = "We extend our analysis of repetitive patterns found in
genetic programming genomes \cite{langdon:2005:CS} 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.",
notes = "Also known as eurogp:LangdonB05
Part of \cite{keijzer:2005:GP} EuroGP'2005 held in
conjunction with EvoCOP2005 and EvoWorkshops2005",
}
Genetic Programming entries for William B Langdon Wolfgang Banzhaf