Skip to main content
SpringerLink
Log in
Book cover

European Conference on Genetic Programming

EuroGP 2003: Genetic Programming pp 254–263Cite as

Modularity in Genetic Programming

  • Conference paper
  • First Online:

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

Abstract

Genetic Programming uses a tree based representation to express solutions to problems. Trees are constructed from a primitive set which consists of a function set and a terminal set. An extension to GP is the ability to define modules, which are in turn tree based representations defined in terms of the primitives. The most well known of these methods is Koza’s Automatically Defined Functions. In this paper it is proved that for a given problem, the minimum number of nodes in the main tree plus the nodes in any modules is independent of the primitive set (up to an additive constant) and depends only on the function being expressed. This reduces the number of user defined parameters in the run and makes the inclusion of a hypothesis in the search space independent of the primitive set.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. J. Angeline and J. B. Pollack. The evolutionary induction of subroutines. In Proceedings of the Fourteenth Annual Conference of the Cognitive Science Society, Bloomington, Indiana, USA, 1992. Lawrence Erlbaum.

    Google Scholar 

  2. Wolfgang Banzhaf, Peter Nordin, Robert E. Keller, and Frank D. Francone. Genetic Programming-An Introduction; On the Automatic Evolution of Computer Programs and its Applications. Morgan Kaufmann, dpunkt.verlag, January 1998.

    Google Scholar 

  3. Thomas M. Cover and Joy A. Thomas. Elements of Information Theory. Wiley Series in Telecommunications. John Wiley & Sons, New York, NY, USA, 1991.

    Google Scholar 

  4. Lorenz Huelsbergen. Toward simulated evolution of machine language iteration. In John R. Koza, David E. Goldberg, David B. Fogel, and Rick L. Riolo, editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 315–320, Stanford University, CA, USA, 28–31 July 1996. MIT Press.

    Google Scholar 

  5. John R. Koza. Genetic Programming: On the Programming of Computers by Means f Natural Selection. MIT Press, 1992.

    Google Scholar 

  6. John R. Koza. Genetic Programming II: Automatic Discovery of Reusable Programs. IT Press, Cambridge Massachusetts, May 1994.

    MATH  Google Scholar 

  7. John R. Koza. Evolving the architecture of a multi-part program in genetic programming using architecture-altering operations. In John Robert McDonnell, Robert G. Reynolds, and David B. Fogel, editors, Evolutionary Programming IV Proceedings of the Fourth Annual Conference on Evolutionary Programming, pages 695–717, San Diego, CA, USA, 1–3 1995. MIT Press.

    Google Scholar 

  8. W. B. Langdon and Riccardo Poli. Foundations of Genetic Programming. Springer-Verlag, 2002.

    Google Scholar 

  9. Julian F. Miller and Peter Thomson. Cartesian genetic programming. In Riccardo Poli, Wolfgang Banzhaf, William B. Langdon, Julian F. Miller, Peter Nordin, and Terence C. Fogarty, editors, Genetic Programming, Proceedings of EuroGP 2000, volume 1802 of LNCS, pages 121–132, Edinburgh, 15–16 April 2000. Springer-Verlag.

    Google Scholar 

  10. J. P. Rosca and D. H. Ballard. Learning by adapting representations in genetic programming. In Proceedings of the 1994 IEEE World Congress on Computational Intelligence, Orlando, Florida, USA, Orlando, Florida, USA, 27–29 June 1994. IEEE Press.

    Google Scholar 

  11. I. Wegener. The Complexity of Boolean Functions. Wiley Teubner, 1987.

    Google Scholar 

  12. J. R. Woodward and J. R. Neil. No free lunch, program induction and combinatorial problems. In Genetic Programming, Proceedings of EuroGP 2003, Essex, UK, 14–16 April 2003. Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, University of Birmingham, B15 2TT, UK

    John R. Woodward

Authors
  1. John R. Woodward
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science and Information Systems, University of Limerick, Limerick, Ireland

    Conor Ryan

  2. Department of Computer Science, University of Idaho, 83844-1010, Moscow, ID, USA

    Terence Soule

  3. Department of Computer Science, Free University of Amsterdam, 1081, HV Amsterdam, The Netherlands

    Maarten Keijzer

  4. Department of Computer Science, University of Essex, Wivenhoe Park, CO4 3SQ, Colchester, UK

    Edward Tsang  & Riccardo Poli  & 

  5. Department of Computer Science, University of Coimbra, Polo II, Pinhal Marrocos, 3030-290, Coimbra, Portugal

    Ernesto Costa

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Woodward, J.R. (2003). Modularity in Genetic Programming. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E., Poli, R., Costa, E. (eds) Genetic Programming. EuroGP 2003. Lecture Notes in Computer Science, vol 2610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36599-0_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-36599-0_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00971-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation