Skip to main content

Solution-Locked Averages and Solution-Time Binning in Genetic Programming

  • Conference paper
  • 757 Accesses

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

Abstract

Averaging data collected in multiple independent runs across generations is the standard method to study the behaviour of GP. We show that while averaging may represent with good resolution GP’s behaviour in the early stages of a run, it blurs later components of the dynamics. We propose two techniques to improve the situation: solution-locked averaging and solution-time binning. Results indicate that there are significant benefits in adopting these techniques.

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Citi, L., Poli, R., Cinel, C.: High-significance averages of event-related potential via genetic programming. In: Riolo, R.L., O’Reilly, U.-M., McConaghy, T. (eds.) Genetic Programming Theory and Practice VII, Genetic and Evolutionary Computation, May 14-16, vol. 9, pp. 135–157. Springer, Ann Arbor (2009)

    Google Scholar 

  2. Hansen, J.C.: Separation of overlapping waveforms having known temporal distributions. Journal of neuroscience methods 9(2), 127–139 (1983)

    Article  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. Luck, S.J.: An introduction to the event-related potential technique. MIT Press, Cambridge (2005)

    Google Scholar 

  5. Poli, R., Cinel, C., Citi, L., Sepulveda, F.: Reaction-time binning: a simple method for increasing the resolving power of ERP averages. Psychophysiology (Forthcoming, 2010)

    Google Scholar 

  6. Poli, R., Langdon, W.B., McPhee, N.F.: A field guide to genetic programming (With contributions by J. R. Koza) (2008), http://lulu.com , http://www.gp-field-guide.org.uk

  7. Zhang, J.: Decomposing stimulus and response component waveforms in ERP. Journal of neuroscience methods 80(1), 49–63 (1998)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Poli, R. (2010). Solution-Locked Averages and Solution-Time Binning 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_18

Download citation

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

  • 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