Skip to main content

Evolving Modules in Genetic Programming by Subtree Encapsulation

  • Conference paper
  • First Online:
Genetic Programming (EuroGP 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2038))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahluwalia M. and Bull L.: Coevolving functions in genetic programming: Classification using K-nearest-neighbour. Proceedings of the Genetic and Evolutionary Computation Conference, Orlando, Florida (1999) 947–953 Morgan Kaufmann

    Google Scholar 

  2. Altenberg L.: The evolution of evolvability in genetic programming. Advances in Genetic Programming, Kinnear K.E. Jr. (ed.) (1994) 47–74 MIT Press

    Google Scholar 

  3. Angeline P.J. and Pollack J.B.: Coevolving high-level representations. Artificial Life III, Langton C.G. (ed.) (1994) 55–71 Addison-Wesley

    Google Scholar 

  4. Dessi A., Giani A. and Starita A.: An analysis of automatic subroutine discovery in genetic programming. Proceedings of the Genetic and Evolutionary Computation Conference, Orlando, Florida (1999) 996–1001 Morgan Kaufmann

    Google Scholar 

  5. Goldberg D.E.: Genetic Algorithms in Search, Optimization and Machine Learning (1989) Addison-Wesley

    Google Scholar 

  6. Holland J.H.: Adaptation in Natural and Artificial Systems, An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence (1992) Second edition (First edition 1975) MIT Press

    Google Scholar 

  7. Howard D. and Roberts S.C.: A staged genetic programming strategy for image analysis. Proceedings of the Genetic and Evolutionary Computation Conference, Orlando, Florida (1999) 1047–1052 Morgan Kaufmann

    Google Scholar 

  8. Igel C. and Chellapilla K.: Investigating the influence of depth and degree of genotypic change on fitness in genetic programming. Proceedings of the Genetic and Evolutionary Computation Conference, Orlando, Florida (1999) 1061–1068 Morgan Kaufmann

    Google Scholar 

  9. Koza J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection (1992) MIT Press

    Google Scholar 

  10. Koza J.R.: Genetic Programming II: Automatic Discovery of Reusable Programs (1994) MIT Press

    Google Scholar 

  11. Koza J.R., Bennett F.H. III, Andre D. and Keane M.A.: Genetic Programming III: Darwinian Invention and Problem Solving (1999) Morgan Kaufmann

    Google Scholar 

  12. Luke S.: Code growth is not caused by introns. Late Breaking Papers at the Genetic and Evolutionary Computation Conference, Las Vegas, Nevada (2000) 228–235

    Google Scholar 

  13. McPhee N.F. and Hopper N.J.: Analysis of genetic diversity through population history. Proceedings of the Genetic and Evolutionary Computation Conference, Orlando, Florida (1999) 1112–1120 Morgan Kaufmann

    Google Scholar 

  14. O’Reilly U.M. and Oppacher F.: The troubling aspects of a building block hypothesis for genetic programming. Foundations of Genetic Algorithms 3, Whitley L.D. and Vose M.D. (eds.) (1995) 73–88 San Mateo, CA, Morgan Kaufmann

    Google Scholar 

  15. Roberts S.C. and Howard D.: Evolution of vehicle detectors for infrared line scan imagery. Joint Proceedings of the European Workshop on Evolutionary Image Analysis, Signal Processing and Telecommunications, Göteborg, Sweden (1999) 111–125 Springer LNCS

    Google Scholar 

  16. Rosca J.P. and Ballard D.H.: Discovery of subroutines in genetic programming. Advances in Genetic Programming 2, Angeline P.J. and Kinnear K.E. Jr. (eds.) Chapter 9 (1996) MIT Press

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Roberts, S.C., Howard, D., Koza, J.R. (2001). Evolving Modules in Genetic Programming by Subtree Encapsulation. In: Miller, J., Tomassini, M., Lanzi, P.L., Ryan, C., Tettamanzi, A.G.B., Langdon, W.B. (eds) Genetic Programming. EuroGP 2001. Lecture Notes in Computer Science, vol 2038. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45355-5_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-45355-5_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41899-3

  • Online ISBN: 978-3-540-45355-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics