%0 Conference Paper %1 roberts:2001:EuroGP %A Roberts, Simon C. %A Howard, Daniel %A Koza, John R. %B Genetic Programming, Proceedings of EuroGP'2001 %C Lake Como, Italy %D 2001 %E Miller, Julian F. %E Tomassini, Marco %E Lanzi, Pier Luca %E Ryan, Conor %E Tettamanzi, Andrea G. B. %E Langdon, William B. %I Springer-Verlag %K Code Encapsulation, Image Modularisation, Processing Reuse, Subtree algorithms, genetic programming, %P 160--175 %T Evolving modules in Genetic Programming by subtree encapsulation %U http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2038&spage=160 %V 2038 %X In tree-based genetic programming (GP), the most frequent subtrees on later generations are likely to constitute useful partial solutions. This paper investigates the effect of encapsulating such subtrees by representing them as atoms in the terminal set, so that the subtree evaluations can be exploited as terminal data. The encapsulation scheme is compared against a second scheme which depends on random subtree selection. Empirical results show that both schemes improve upon standard GP. %@ 3-540-41899-7

@inproceedings{roberts:2001:EuroGP, abstract = {In tree-based genetic programming (GP), the most frequent subtrees on later generations are likely to constitute useful partial solutions. This paper investigates the effect of encapsulating such subtrees by representing them as atoms in the terminal set, so that the subtree evaluations can be exploited as terminal data. The encapsulation scheme is compared against a second scheme which depends on random subtree selection. Empirical results show that both schemes improve upon standard GP.}, added-at = {2008-06-19T17:46:40.000+0200}, address = {Lake Como, Italy}, author = {Roberts, Simon C. and Howard, Daniel and Koza, John R.}, biburl = {https://www.bibsonomy.org/bibtex/2ed489c1264bd9f8b658dcd20674c1cd1/brazovayeye}, booktitle = {Genetic Programming, Proceedings of EuroGP'2001}, editor = {Miller, Julian F. and Tomassini, Marco and Lanzi, Pier Luca and Ryan, Conor and Tettamanzi, Andrea G. B. and Langdon, William B.}, interhash = {71241481954f97497ec0f00393448d74}, intrahash = {ed489c1264bd9f8b658dcd20674c1cd1}, isbn = {3-540-41899-7}, keywords = {Code Encapsulation, Image Modularisation, Processing Reuse, Subtree algorithms, genetic programming,}, month = {18-20 April}, notes = {EuroGP'2001, part of \cite{miller:2001:gp}}, organisation = {EvoNET}, pages = {160--175}, publisher = {Springer-Verlag}, publisher_address = {Berlin}, series = {LNCS}, size = {16 pages}, timestamp = {2008-06-19T17:50:18.000+0200}, title = {Evolving modules in Genetic Programming by subtree encapsulation}, url = {http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2038&spage=160}, volume = 2038, year = 2001 }