Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Analysis of Building Blocks with Numerical Simplification in Genetic Programming

  • Conference paper
Genetic Programming (EuroGP 2010)

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

Included in the following conference series:

Abstract

This paper investigates the effect of numerical simplification on building blocks during evolution in genetic programming. The building blocks considered are three level subtrees. We develop a method for encoding building blocks for the analysis. Compared with the canonical genetic programming method, numerical simplification can generate much smaller programs, use much shorter evolutionary training time and achieve comparable effectiveness performance.

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. Soule, T., Foster, J.A., Dickinson, J.: Code growth in genetic programming. In: Koza, J.R., et al. (eds.) Genetic Programming 1996: Proceedings of the First Annual Conference, Stanford University, CA, USA, pp. 215–223. MIT Press, Cambridge (1996)

    Google Scholar 

  2. Blickle, T., Thiele, L.: Genetic programming and redundancy. In: Hopf, J. (ed.) Genetic Algorithms within the Framework of Evolutionary Computation (Workshop at KI 1994), Saarbrücken, Germany, pp. 33–38 (1994)

    Google Scholar 

  3. Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)

    MATH  Google Scholar 

  4. Nordin, P., Banzhaf, W.: Complexity compression and evolution. In: Eshelman, L. (ed.) Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA 1995), USA, 15-19 July, pp. 310–317. Morgan Kaufmann, San Francisco (1995)

    Google Scholar 

  5. Zhang, B.-T., Mühlenbein, H.: Balancing accuracy and parsimony in genetic programming. Evolutionary Computation 3(1), 17–38 (1995)

    Article  Google Scholar 

  6. Gustafson, S., Ekart, A., Burke, E., Kendall, G.: Problem difficulty and code growth in genetic programming. Genetic Programming and Evolvable Machines 5(3), 271–290 (2004)

    Article  Google Scholar 

  7. Langdon, W.B.: Quadratic bloat in genetic programming. In: Whitley, D., et al. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2000), USA, 10-12 July, pp. 451–458 (2000)

    Google Scholar 

  8. Banzhaf, W., Nordin, P., Keller, R.E., Francone, F.D.: Genetic Programming: An Introduction on the Automatic Evolution of Computer Programs and its Applications. Morgan Kaufmann Publishers, San Francisco (1998)

    MATH  Google Scholar 

  9. Poli, R.: A simple but theoretically-motivated method to control bloat in genetic programming. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E.P.K., Poli, R., Costa, E. (eds.) EuroGP 2003. LNCS, vol. 2610, pp. 204–217. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  10. Langdon, W.B., Poli, R.: Fitness causes bloat. In: Chawdhry, P.K., Roy, R., Pant, R.K. (eds.) Soft Computing in Engineering Design and Manufacturing, pp. 13–22. Springer, Heidelberg (1997)

    Google Scholar 

  11. Parrott, D., Li, X., Ciesielski, V.: Multi-objective techniques in genetic programming for evolving classifiers. In: Corne, D., et al. (eds.) Proceedings of the 2005 IEEE Congress on Evolutionary Computation, Edinburgh, UK, September 2–5, vol. 2, pp. 1141–1148. IEEE Press, Los Alamitos (2005)

    Chapter  Google Scholar 

  12. Brameier, M., Banzhaf, W.: A comparison of linear genetic programming and neural networks in medical data mining. IEEE Transactions on Evolutionary Computation 5(1), 17–26 (2001)

    Article  Google Scholar 

  13. Hooper, D., Flann, N.S.: Improving the accuracy and robustness of genetic programming through expression simplification. In: Koza, J.R., et al. (eds.) Genetic Programming 1996: Proceedings of the First Annual Conference, Stanford University, CA, USA, July 28–31, p. 428. MIT Press, Cambridge (1996)

    Google Scholar 

  14. Ekart, A.: Shorter fitness preserving genetic programs. In: Fonlupt, C., Hao, J.-K., Lutton, E., Schoenauer, M., Ronald, E. (eds.) AE 1999. LNCS, vol. 1829, pp. 73–83. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  15. Zhang, M., Zhang, Y., Smart, W.D.: Program simplification in genetic programming for object classification. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds.) KES 2005. LNCS (LNAI), vol. 3683, pp. 988–996. Springer, Heidelberg (2005)

    Google Scholar 

  16. Wong, P., Zhang, M.: Algebraic simplification of GP programs during evolution. In: Keijzer, M., et al. (eds.) GECCO 2006: Proceedings of the 8th annual conference on Genetic and evolutionary computation, USA, vol. 1, pp. 927–934. ACM Press, New York (2006)

    Chapter  Google Scholar 

  17. Kinzett, D., Zhang, M., Johnston, M.: Using numerical simplification to control bloat in genetic programming. In: Li, X., Kirley, M., Zhang, M., Green, D., Ciesielski, V., Abbass, H.A., Michalewicz, Z., Hendtlass, T., Deb, K., Tan, K.C., Branke, J., Shi, Y. (eds.) SEAL 2008. LNCS, vol. 5361, pp. 493–502. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  18. Kinzett, D., Johnston, M., Zhang, M.: How Online Simplification Affects Building Blocks in Genetic Programming. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation GECCO 2009, Montreal, Quebec, Canada, July 08–12, pp. 979–986. ACM, New York (2009)

    Chapter  Google Scholar 

  19. Marshall, D.: The discrete cosine transform (2001), http://www.cs.cf.ac.uk/Dave/Multimedia/node231.htm

  20. Forina, R., Leardi, M., Armanino, C., Lanteri, S.: Parvus: an extendable package of programs for data exploration, classification and correlation. Elsevier Scientific, Amsterdam (1988)

    Google Scholar 

  21. Witten, I., Frank, E.: Data Mining: Practical Machine Learning Tools and Techniques, 2nd edn. Morgan Kaufmann, San Francisco (2005)

    MATH  Google Scholar 

  22. Samaria, F., Harter, A.C.: Parameterisation of a stochastic model for human face identification. In: Proceedings of the Second IEEE Workshop on Applications of Computer Vision (1994)

    Google Scholar 

  23. Zhang, M., Andreae, P., Pritchard, M.: Pixel Statistics and False Alarm Area in Genetic Programming for Object Detection. In: Raidl, G.R., Cagnoni, S., Cardalda, J.J.R., Corne, D.W., Gottlieb, J., Guillot, A., Hart, E., Johnson, C.G., Marchiori, E., Meyer, J.-A., Middendorf, M. (eds.) EvoIASP 2003, EvoWorkshops 2003, EvoSTIM 2003, EvoROB/EvoRobot 2003, EvoCOP 2003, EvoBIO 2003, and EvoMUSART 2003. LNCS, vol. 2611, pp. 455–466. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  24. Wilcoxon, F.: Individual comparisons by ranking methods. Biometrics 1, 80–83 (1945)

    Article  Google Scholar 

  25. LaVange, L.M., Koch, G.G.: Rank score tests. Circulation 114(23), 2528–2533 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Engineering and Computer Science,  

    David Kinzett & Mengjie Zhang

  2. School of Mathematics and Operations Research, Victoria University of Wellington, PO Box 600, Wellington, New Zealand

    Mark Johnston

Authors
  1. David Kinzett
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mengjie Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mark Johnston
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Instituto Tecnologico de Informatica, Universidad Politecnica de Valencia, Camino de Vera s/n, 46022, Valencia, Spain

    Anna Isabel Esparcia-Alcázar

  2. Computer Science, Aston Triangle, Aston University, B4 7ET, Birmingham, UK

    Anikó Ekárt

  3. INESC-ID Lisboa, Rua Alves Redol 9, 1000-029, Lisboa, Portugal

    Sara Silva

  4. School of Computer Science and Electronic Engineering, University of Essex, Wivenhoe Park, CO4 3SQ, Colchester, UK

    Stephen Dignum

  5. Computer Engineering Department, Istanbul Technical University, Room Nr. 3302, 34469, Maslak, Istanbul, Turkey

    A. Şima Uyar

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kinzett, D., Zhang, M., Johnston, M. (2010). Analysis of Building Blocks with Numerical Simplification in Genetic Programming. In: Esparcia-Alcázar, A.I., Ekárt, A., Silva, S., Dignum, S., Uyar, A.Ş. (eds) Genetic Programming. EuroGP 2010. Lecture Notes in Computer Science, vol 6021. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12148-7_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12148-7_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12147-0

  • Online ISBN: 978-3-642-12148-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation