Abstract
In this paper we report the results of a comparative study on different variations of genetic programming applied on binary data classiffication problems. The ffirst genetic programming variant is weighting data records for calculating the classiffication error and modifying the weights during the run. Hereby the algorithm is deffining its own ffitness function in an on-line fashion giving higher weights to ‘hard’ records. Another novel feature we study is the atomic representation, where ‘Booleanization’ of data is not performed at the root, but at the leafs of the trees and only Boolean functions are used in the trees’ body. As a third aspect we look at generational and steady-state models in combination of both features.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Wolfgang Banzhaf, Peter Nordin, Robert E. Keller, and Frank D. Francone. Genetic Programming-An Introduction; On the Automatic Evolution of Computer Programs and its Applications. Morgan Kaufmann, dpunkt.verlag, January 1998.
J. Eggermont, A. E. Eiben, and J. I. van Hemert. Adapting the fitness function in GP for data mining. In P. Nordin and R. Poli,editors, Proceedings of Second European Workshop on Genetic Programming, LNCS. Springer, Berlin, 1999. in press.
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.
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.
E. Gamma, R. Helm, R. Johnson, and J. Vlissides. Design Patterns: elements of reusable object-oriented software. Addison-Wesley, 1994.
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.
J. R. Koza. Genetic Programming. MIT Press, 1992.
W. B. Langdon. Genetic Programming + Data Structures = Automatic Programming! Kluwer, 1998.
D. Michie, D. J. Spiegelhalter, and C. C. Taylor,editors. Machine Learning, Neural and Statistical Classification. Ellis Horwood, February 1994.
D. Whitley. The GENITOR algorithm and selection pressure: Why rank-based allocation of reproductive trials is best. In J. David Schaffer,editor, Proceedings of the Third International Conference on Genetic Algorithms (ICGA’89), pages 116–123, San Mateo, California, 1989. Morgan Kaufmann Publishers, Inc.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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). A Comparison of Genetic Programming Variants for Data Classification. In: Hand, D.J., Kok, J.N., Berthold, M.R. (eds) Advances in Intelligent Data Analysis. IDA 1999. Lecture Notes in Computer Science, vol 1642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48412-4_24
Download citation
DOI: https://doi.org/10.1007/3-540-48412-4_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66332-4
Online ISBN: 978-3-540-48412-7
eBook Packages: Springer Book Archive