%0 Conference Paper %1 langdon:2005:eurogp %A Langdon, William B. %A Banzhaf, Wolfgang %B Proceedings of the 8th European Conference on Genetic Programming %C Lausanne, Switzerland %D 2005 %E Keijzer, Maarten %E Tettamanzi, Andrea %E Collet, Pierre %E van Hemert, Jano I. %E Tomassini, Marco %I Springer %K algorithms, frequent genetic programming, subgraphs subtrees, %P 190--202 %R doi:10.1007/b107383 %T Repeated Patterns in Tree Genetic Programming %U http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3447&spage=190 %V 3447 %X We extend our analysis of repetitive patterns found in genetic programming genomes 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. %@ 3-540-25436-6

@inproceedings{langdon:2005:eurogp, 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.}, added-at = {2008-06-19T17:35:00.000+0200}, address = {Lausanne, Switzerland}, author = {Langdon, William B. and Banzhaf, Wolfgang}, bibsource = {DBLP, http://dblp.uni-trier.de}, biburl = {https://www.bibsonomy.org/bibtex/290fc372618b26ca1fe2a3c21081c72af/brazovayeye}, booktitle = {Proceedings of the 8th European Conference on Genetic Programming}, doi = {doi:10.1007/b107383}, editor = {Keijzer, Maarten and Tettamanzi, Andrea and Collet, Pierre and {van Hemert}, Jano I. and Tomassini, Marco}, interhash = {a928bce705f096bba58374ab7d1e7e90}, intrahash = {90fc372618b26ca1fe2a3c21081c72af}, isbn = {3-540-25436-6}, keywords = {algorithms, frequent genetic programming, subgraphs subtrees,}, month = {30 March - 1 April}, notes = {Also known as eurogp:LangdonB05 Part of \cite{keijzer:2005:GP} EuroGP'2005 held in conjunction with EvoCOP2005 and EvoWorkshops2005}, organisation = {EvoNet}, pages = {190--202}, publisher = {Springer}, publisher_address = {Berlin}, series = {Lecture Notes in Computer Science}, timestamp = {2008-06-19T17:45:04.000+0200}, title = {Repeated Patterns in Tree Genetic Programming}, url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3447&spage=190}, volume = 3447, year = 2005 }