Skip to main content

Analysis of a Digit Concatenation Approach to Constant Creation

  • Conference paper
  • First Online:

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

Abstract

This study examines the utility of employing digit concatenation, as distinct from the traditional expression based approach, for the purpose of evolving constants in Grammatical Evolution. Digit concatenation involves creating constants (either whole or real numbers) by concatenating digits to form a single value. The two methods are compared using three different problems, which are finding a static real constant, finding dynamic real constants, and a quadratic map, which on iteration generates a chaotic time-series. The results indicate that the digit concatenation approach results in a significant improvement in the best fitness obtained across all problems analysed here.

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

Buying options

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. Angeline, Peter J. (1996). Two Self-Adaptive Crossover Operators for Genetic Programming. In Peter J. Angeline and K. E. Kinnear, Jr. (Eds.), Advances in Genetic Programming 2, Chapter 5, pp.89–110, MIT Press.

    Google Scholar 

  2. Castillo, E. and Gutierrez, J. (1998). Nonlinear time series modeling and prediction using functional networks. Extracting information masked by chaos, Physics Letters A, 244:71–84.

    Google Scholar 

  3. Dempsey, I., O’Neill, M. and Brabazon, T. (2002). Investigations into Market Index Trading Models Using Evolutionary Automatic Programming, In Lecture Notes in Artificial Intelligence, 2464, Proceedings of the 13th Irish Conference in Artificial Intelligence and Cognitive Science, pp. 165–170, edited by M. O’Neill, R. Sutclifie, C. Ryan, M. Eaton and N. Griffth, Berlin: Springer-Verlag.

    Google Scholar 

  4. Evett, Matthew and Fernandez, Thomas. (1998). Numeric Mutation Improves the Discovery of Numeric Constants in Genetic Programming, Genetic Programming 1998: Proceedings of the Third Annual Conference, University of Wisconsin, Madison, Wisconsin, USA, pp.66–71, Morgan Kaufmann.

    Google Scholar 

  5. Holland, J. (1998). Emergence from Chaos to Order,Oxford: Oxford University Press.

    MATH  Google Scholar 

  6. Koza, J. (1992). Genetic Programming. MIT Press.

    Google Scholar 

  7. May, R. (1976). Simple mathematical models with very complicated dynamics, Nature, 261:459–467.

    Article  Google Scholar 

  8. Nie, J. (1997). Nonlinear time-series forecasting: A fuzzy-neural approach, Neurocomputing, 16:63–76.

    Article  Google Scholar 

  9. O’Neill, M. (2001). Automatic Programming in an Arbitrary Language: Evolving Programs in Grammatical Evolution. PhD thesis, University of Limerick, 2001.

    Google Scholar 

  10. O’Neill, M., Ryan, C. (1999). Automatic Generation of Caching Algorithms, In K. Miettinen and M.M. Mäkelä and J. Toivanen (Eds.) Proceedings of EUROGEN99, Jyväskylä, Finland, pp.127–134, University of Jyväskylä

    Google Scholar 

  11. O’Neill, M., Ryan, C. (2001) Grammatical Evolution, IEEE Trans. Evolutionary Computation, 5(4):349–358, 2001.

    Article  Google Scholar 

  12. Ryan C., Collins J.J., O’Neill M. (1998). Grammatical Evolution: Evolving Programs for an Arbitrary Language. Lecture Notes in Computer Science 1391, Proceedings of the First European Workshop on Genetic Programming, 83–95, Springer-Verlag.

    Google Scholar 

  13. Saxen, H. (1996). On the approximation of a quadratic map by a small neural network, Neurocomputing, 12:313–326.

    Article  MATH  Google Scholar 

  14. Spencer, G. (1994). Automatic Generation of Programs for Crawling and Walking. In Kenneth E. Kinnear, Jr. (Ed), Advances in Genetic Programming, Chapter 15, pp. 335–353, 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

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

O’Neill, M., Dempsey, I., Brabazon, A., Ryan, C. (2003). Analysis of a Digit Concatenation Approach to Constant Creation. 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_16

Download citation

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

  • 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