Skip to main content

More on Computational Effort Statistics for Genetic Programming

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

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

Included in the following conference series:

Abstract

In this contribution we take a look at the computational effort statistics as described by Koza. We transfer the notion from generational genetic programming to tournament-selection (steady-state) GP and show why, in both cases, the measured value of the effort often differs from its theoretical counterpart. It is discussed how systematic estimation errors are introduced by a low number of experiments. Two reasons examined are the number of unsuccessful experiments and the variation in the number of fitness evaluations necessary to find a solution among the successful experiments.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W. Banzhaf, P. Nordin, R. E. Keller, F. D. Francone: Genetic Programming: An Introduction. San Francisco, CA: Morgan Kaufmann, 1998

    MATH  Google Scholar 

  2. S. Christensen and F. Oppacher: An Analysis of Koza’s Computational Effort Statistic for Genetic In: J. A. Foster, E. Lutton, J. Miller, C. Ryan, and A. G. B. Tettamanzi,(eds.), Proceedings of the 5th European Conference on Genetic Programming, EuroGP 2002, volume 2278 of LNCS, Kinsale, Ireland, 3–5 April 2002. Springer-Verlag, pages 182–191

    Google Scholar 

  3. M. Keijzer, et al: Adaptive Logic Programming. In: Spector, L., et al (eds.): Proceedings of the 2001 Genetic and Evolutionary Computation Conference: GECCO 2001, Morgan Kaufmann, pages 42–49

    Google Scholar 

  4. J. R. Koza: Genetic Programming: On the Programming of Computers by Natural Selection. Cambridge, MA: MIT Press, 1992

    MATH  Google Scholar 

  5. S. Luke and L. Panait: Is the Perfect the Enemy of the Good? In: W. B. Langdon et al. (eds.), Proceedings of the 2002 Genetic and Evolutionary Computation Conference: GECCO 2002, Morgan Kaufman, pages 820–828

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Niehaus, J., Banzhaf, W. (2003). More on Computational Effort Statistics for 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_15

Download citation

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

  • 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