Skip to main content
SpringerLink
Log in

Identifying Structural Mechanisms in Standard Genetic Programming

  • Conference paper
  • First Online:
Genetic and Evolutionary Computation — GECCO 2003 (GECCO 2003)

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

Included in the following conference series:

Abstract

This paper presents a hypothesis about an undiscovered class of mechanisms that exist in standard GP. Rather than being intentionally designed, these mechanisms would be an unintended consequence of using trees as information structures. A model is described that predicts outcomes in GP that would arise solely from such mechanisms. Comparisons with empirical results from GP lend support to the existence of these mechanisms.

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

Access this chapter

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 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. T. Soule, et al., “Code Growth in Genetic Programming,” in GP 1996, J.R. Koza, et al., Eds. Cambridge: The MIT Press, 1996, pp. 215–223.

    Google Scholar 

  2. W.B. Langdon, et al., “The Evolution of Size and Shape,” in Advances in Genetic Programming 3, L. Spector, et al. Eds. Cambridge: The MIT Press, 1999, pp. 163–190.

    Google Scholar 

  3. W.B. Langdon and R. Poli, Foundations of Genetic Programming. Berlin: Springer-Verlag, 2002.

    Book  MATH  Google Scholar 

  4. P.J. Angeline, “Parse Trees,” in Handbook of Evolutionary Computation, T. Bäck, et al., Eds. Bristol: Institute of Physics Publishing, 1997, pp. C1.6:1–C1.6:3.

    Google Scholar 

  5. K. Deb, “Introduction [to Issues in Representations],” in Handbook of Evolutionary Computation, T. Bäck, et al., Eds. Bristol: Institute of Physics Publishing, 1997, pp. C1.1:1–C1.1:4.

    Google Scholar 

  6. D.B. Fogel and P.J. Angeline, “Guidelines for a Suitable Encoding,” in Handbook of Evolutionary Computation, T. Bäck, et al., Eds. Bristol: Institute of Physics Publishing, 1997, pp. C1.7:1–C1.7:2.

    Google Scholar 

  7. D.H. Wolpert and W.G. Macready, “No Free Lunch Theorems for Optimization,” IEEE Transactions on Evolutionary Computation, vol. 1, pp. 67–82, 1997.

    Article  Google Scholar 

  8. D.E. Knuth, The Art of Computer Programming: Volume 1: Fundamental Algorithms, vol. 1, Third ed. Reading: Addison-Wesley, 1997.

    MATH  Google Scholar 

  9. L. Alonso and R. Schott, Random Generation of Trees. Boston: Kluwer Academic Publishers, 1995.

    Google Scholar 

  10. P. Flajolet and A. Odlyzko, “The Average Height of Binary Trees and Other Simple Trees,” Journal of Computer and System Sciences, vol. 25, pp. 171–213, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  11. J. Knowles and D. Corne, “A New Evolutionary Approach to the Degree Constrained Minimum Spanning Tree Problem,” IEEE Transactions on Evolutionary Computation, vol. 4, pp. 125–134, 2000.

    Article  Google Scholar 

  12. G.R. Raidl, “A Hybrid GP Approach for Numerically Robust Symbolic Regression,” in GP 1998, J. R. Koza, et al., Eds. San Francisco: Morgan Kaufmann Publishers, 1998, pp. 323–328.

    Google Scholar 

  13. G. Kirchoff, Annalen der Physik und Chemie, vol. 72, pp. 497–508, 1847.

    Article  Google Scholar 

  14. A. Cayley, Collected Mathematical Papers of A. Cayley, vol. 3, 1857.

    Google Scholar 

  15. H. G. Kahrimanian, presented at Symposium on Automatic Programming, Washington, D.C., 1954.

    Google Scholar 

  16. J.M. Daida and A. Hilss,“Visualizing Tree Structures in Genetic Programming,” GECCO 2003.

    Google Scholar 

  17. J.M. Daida, et al., “Analysis of Single-Node (Building) Blocks in Genetic Programming,” in Advances in Genetic Programming 3, L. Spector, et al., Eds. Cambridge: The MIT Press, 1999, pp. 217–241.

    Google Scholar 

  18. J.M. Daida, et al., “What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in GP,” in GECCO 1999, W. Banzhaf, et al., Eds. San Francisco: Morgan Kaufmann Publishers, 1999, pp. 982–989.

    Google Scholar 

  19. O.A. Chaudhri, et al., “Characterizing a Tunably Difficult Problem in Genetic Programming,” in GECCO 2000, L. D. Whitley, et al. Eds. San Francisco: Morgan Kaufmann Publishers, 2000, pp. 395–402.

    Google Scholar 

  20. JM. Daida, et al., “What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming,” Journal of Genetic Programming and Evolvable Hardware, vol. 2, pp. 165–191, 2001.

    Article  MATH  Google Scholar 

  21. J. R. Koza, Genetic Programming II: Automatic Discovery of Reusable Programs. Cambridge: The MIT Press, 1994.

    MATH  Google Scholar 

  22. W.B. Langdon, “Quadratic Bloat in Genetic Programming,” in GECCO 2000, L. D. Whitley, et al., Eds. San Francisco: Morgan Kaufmann Publishers, 2000, pp. 451–458.

    Google Scholar 

  23. D. Zongker and W. Punch, “lilgp,” v. 1.02 ed. Lansing: Michigan State University Genetic Algorithms Research and Applications Group, 1995.

    Google Scholar 

  24. M. Matsumoto and T. Nishimura, “Mersenne Twister: A 623-Dimensionally Equidistributed Uniform Pseudorandom Number Generator,” ACM Transactions on Modeling and Computer Simulation, vol. 8, pp. 3–30, 1998.

    Article  MATH  Google Scholar 

  25. W.B. Langdon, “Size Fair and Homologous Tree Crossovers for Tree Genetic Programming,” Journal of Genetic Programming and Evolvable Machines, vol. 1, pp. 95–119, 2000.

    Article  MATH  Google Scholar 

  26. T. A. Witten and L. M. Sander, “Diffusion-Limited Aggregation: A Kinetic Critical Phenomenon,” Physics Review Letters, vol. 47, pp. 1400–1403, 1981.

    Article  Google Scholar 

  27. J.M. Daida, et al., “What Makes a Problem GP-Hard? Validating a Hypothesis of Structural Causes,” GECCO 2003.

    Google Scholar 

  28. J.M. Daida, “Limits to Expression in Genetic Programming: Lattice-Aggregate Modeling,” CEC 2002, Piscataway: IEEE Press, pp. 273–278.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for the Study of Complex Systems and the Space Physics Research Laboratory, The University of Michigan, 2455 Hayward Avenue, Ann Arbor, Michigan, 48109-2143

    Jason M. Daida & Adam M. Hilss

Authors
  1. Jason M. Daida
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Adam M. Hilss
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Center for Applied Scientific Computing (CASC), Lawrence Livermore National Laboratory, 7000 East Avenue, L-561, Livermore, CA, 94550, USA

    Erick Cantú-Paz

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Daida, J.M., Hilss, A.M. (2003). Identifying Structural Mechanisms in Standard Genetic Programming. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45110-2_58

Download citation

  • DOI: https://doi.org/10.1007/3-540-45110-2_58

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40603-7

  • Online ISBN: 978-3-540-45110-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation