Skip to main content

Parameterised Indexed FOR-Loops in Genetic Programming and Regular Binary Pattern Strings

  • Conference paper
Book cover Simulated Evolution and Learning (SEAL 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5361))

Included in the following conference series:

  • 1435 Accesses

Abstract

We present two methods to represent and use parameterised indexed FOR-loops in genetic programming. They are tested on learning the repetitive unit of regular binary pattern strings to reproduce these patterns to user specified arbitrary lengths. Particularly, we investigate the effectiveness of low-level and high-level functions inside these loops for the accuracy and the semantic efficiency of solutions. We used 5 test cases at increasing difficulty levels and our results show the high-level approach producing solutions in at least 19% of the runs when the low-level approach struggled to produce any in most cases.

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. Chen, G., Zhang, M.: Evolving while-loop structures in genetic programming for factorial and ant problems. In: Zhang, S., Jarvis, R. (eds.) AI 2005. LNCS, vol. 3809, pp. 1079–1085. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  2. Ciesielski, V., Li, X.: Experiments with explicit for-loops in genetic programming. In: Proceedings of the 2004 IEEE Congress on Evolutionary Computation, Portland, Oregon, June 20-23, pp. 494–501. IEEE Press, Los Alamitos (2004)

    Google Scholar 

  3. Kinnear Jr., K.E.: Evolving a sort: Lessons in genetic programming. In: Proceedings of the 1993 International Conference on Neural Networks, San Francisco, USA, vol. 2, pp. 881–888. IEEE Press, Los Alamitos (1993)

    Google Scholar 

  4. Koza, J.R., Andre, D., Bennett III, F.H., Keane, M.: Genetic Programming 3: Darwinian Invention and Problem Solving. Morgan Kaufman, San Francisco (1999)

    MATH  Google Scholar 

  5. Langdon, W.B.: Data structures and genetic programming. In: Angeline, P.J., Kinnear Jr., K.E. (eds.) Advances in Genetic Programming 2, pp. 395–414. MIT Press, Cambridge (1996)

    Google Scholar 

  6. Li, X., Ciesielski, V.: Using loops in genetic programming for a two class binary image classification problem. In: Webb, G.I., Yu, X. (eds.) AI 2004. LNCS, vol. 3339, pp. 898–909. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  7. Pillay, N.: Using genetic programming for the induction of novice procedural programming solution algorithms. In: SAC 2002: Proceedings of the 2002 ACM symposium on Applied computing, Madrid, Spain, pp. 578–583. ACM Press, New York (2002)

    Google Scholar 

  8. Wijesinghe, G., Ciesielski, V.: Using restricted loops in genetic programming for image classification. In: Srinivasan, D., Wang, L. (eds.) 2007 IEEE Congress on Evolutionary Computation, Singapore, September 25-28, 2007, pp. 4569–4576. IEEE Computational Intelligence Society, IEEE Press (2007)

    Google Scholar 

  9. Wijesinghe, G., Ciesielski, V.: Experiments with Indexed FOR-Loops in Genetic Programming. In: GECCO 2008: Proceedings of the 10th annual conference on Genetic and evolutionary computation, Atlanta, GA, USA, July 12-16, 2008, pp. 1347–1348. ACM, New York (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wijesinghe, G., Ciesielski, V. (2008). Parameterised Indexed FOR-Loops in Genetic Programming and Regular Binary Pattern Strings. In: Li, X., et al. Simulated Evolution and Learning. SEAL 2008. Lecture Notes in Computer Science, vol 5361. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89694-4_53

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89694-4_53

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-89694-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics