Skip to main content

Adapting the Fitness Function in GP for Data Mining

  • Conference paper
  • First Online:
Genetic Programming (EuroGP 1999)

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

Included in the following conference series:

Abstract

In this paper we describe how the Stepwise Adaptation of Weights (SAW) technique can be applied in genetic programming. The SAW-ing mechanism has been originally developed for and successfully used in EAs for constraint satisfaction problems. Here we identify the very basic underlying ideas behind SAW-ing and point out how it can be used for different types of problems. In particular, SAW-ing is wellsuited for data mining tasks where the fitness of a candidate solution is composed by ‘local scores’ on data records. We evaluate the power of the SAW-ing mechanism on a number of benchmark classification data sets. The results indicate that extending the GP with the SAW-ing feature increases its performance when different types of misclassifications are not weighted differently, but leads to worse results when they are.

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 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. Th. Bäck, A.E. Eiben, and M.E. Vink. A superior evolutionary algorithm for 3-SAT. In V. William Porto, N. Saravanan, Don Waagen, and A.E. Eiben, editors, Proceedings of the 7th Annual Conference on Evolutionary Programming, number 1477 in LNCS, pages 125–136. Springer, Berlin, 1998.

    Google Scholar 

  2. A.E. Eiben and J.K. van der Hauw. Graph coloring with adaptive evolutionary algorithms. Technical Report TR-96-11, Leiden University, August 1996. Also available as http://www.wi.leidenuniv.nl/~gusz/graphcol.ps.gz.

  3. A.E. Eiben and J.K. van der Hauw. Solving 3-SAT with adaptive Genetic Algorithms. In Proceedings of the 4th IEEE Conference on Evolutionary Computation, pages 81–86. IEEE Press, 1997.

    Google Scholar 

  4. A.E. Eiben and J.K. van der Hauw. Adaptive penalties for evolutionary graph-coloring. In J.-K. Hao, E. Lutton, E. Ronald, M. Schoenauer, and D. Snyers, editors, Artificial Evolution’97, number 1363 in LNCS, pages 95–106. Springer, Berlin, 1998.

    Chapter  Google Scholar 

  5. A.E. Eiben, J.K. van der Hauw, and J.I. van Hemert. Graph coloring with adaptive evolutionary algorithms. Journal of Heuristics, 4(1):25–46, 1998.

    Article  MATH  Google Scholar 

  6. A.E. Eiben, J.I. van Hemert, E. Marchiori, and A.G. Steenbeek. Solving binary constraint satisfaction problems using evolutionary algorithms with an adaptive fitness function. In A.E. Eiben, Th. Bäck, M. Schoenauer, and H.-P. Schwefel, editors, Proceedings of the 5th Conference on Parallel Problem Solving from Nature, number 1498 in LNCS, pages 196–205, Berlin, 1998. Springer.

    Google Scholar 

  7. E. Gamma, R. Helm, R. Johnson, and J. Vlissides, Design Patterns: elements of reusable object-oriented software. Addison-Wesley, 1994.

    Google Scholar 

  8. J.K. van der Hauw. Evaluating and improving steady state evolutionary algorithms on constraint satisfaction problems. Master’s thesis, Leiden University, 1996. Also available as http://www.wi.leidenuniv.nl/MScThesis/IR96-21.html.

  9. J.I. van Hemert. Applying adaptive evolutionary algorithms to hard problems. Master’s thesis, Leiden University, 1998. Also available as http://www.wi.leidenuniv.nl/~jvhemert/publications/IR-98-19.ps.gz.

  10. J.I. van Hemert. Library for Evolutionary Algorithm Programming (LEAP). Leiden University, LEAP version 0.1.2 edition, 1998. Also available at http://www.wi.leidenuniv.nl/~jvhemert/leap.

  11. J.R. Koza. Genetic Programming. MIT Press, 1992.

    Google Scholar 

  12. D. Michie, D.J. Spiegelhalter, and C.C. Taylor, editors. Machine Learning, Neural and Statistical Classification. Ellis Horwwod, February 1994.

    Google Scholar 

  13. M. Vink. Solving combinatorial problems using evolutionary algorithms. Master’s thesis, Leiden University, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Eggermont, J., Eiben, A.E., van Hemert, J.I. (1999). Adapting the Fitness Function in GP for Data Mining. In: Poli, R., Nordin, P., Langdon, W.B., Fogarty, T.C. (eds) Genetic Programming. EuroGP 1999. Lecture Notes in Computer Science, vol 1598. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48885-5_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-48885-5_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65899-3

  • Online ISBN: 978-3-540-48885-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics