Abstract
We show how the understandability and speed of genetic programming classification algorithms can be improved, without affecting the classification accuracy. By analyzing the decision trees evolved we can remove the unessential parts, called introns, from the discovered decision trees. Since the resulting trees contain only useful information they are smaller and easier to understand. Moreover, by using these pruned decision trees in a fitness cache we can significantly reduce the number of unnecessary fitness calculations.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Banzhaf, W., Nordin, P., Keller, R., Francone, F.: Genetic Programming: An Introduction. Morgan Kaufmann, San Francisco (1998)
Soule, T., Foster, J.A., Dickinson, J.: Code growth in genetic programming. In: J.K., et al. (eds.) Genetic Programming 1996: Proceedings of the First Annual Conference, pp. 215–223. MIT Press, Cambridge (1996)
Soule, T., Foster, J.A.: Code size and depth flows in genetic programming. In: J.K., et al. (eds.) Genetic Programming 1997: Proceedings of the Second Annual Conference, pp. 313–320. Morgan Kaufmann, San Francisco (1997)
Angeline, P.: Genetic programming and emergent intelligence. In: Kinnear Jr., K. (ed.) Advances in Genetic Programming, pp. 75–98. MIT Press, Cambridge (1994)
Eggermont, J., Kok, J., Kosters, W.: Genetic programming for data classification: Partitioning the search space. In: Proceedings of the 2004 Symposium on applied computing (ACM SAC 2004), pp. 1001–1005. ACM, New York (2004)
Eggermont, J.: Evolving fuzzy decision trees with genetic programming and clustering. In: Foster, J.A., Lutton, E., Miller, J., Ryan, C., Tettamanzi, A.G.B. (eds.) EuroGP 2002. LNCS, vol. 2278, pp. 71–82. Springer, Heidelberg (2002)
Witten, I., Frank, E.: Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations. Morgan Kaufmann, San Francisco (2000)
Johnson, C.: Deriving genetic programming fitness properties by static analysis. In: Foster, J.A., Lutton, E., Miller, J., Ryan, C., Tettamanzi, A.G.B. (eds.) EuroGP 2002. LNCS, vol. 2278, pp. 298–307. Springer, Heidelberg (2002)
Nielson, F., Nielson, H., Hankin, C.: Principles of Program Analysis. Springer, Heidelberg (1999)
Keijzer, M.: Improving symbolic regression with interval arithmetic and linear scaling. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E.P.K., Poli, R., Costa, E. (eds.) EuroGP 2003. LNCS, vol. 2610, pp. 71–83. Springer, Heidelberg (2003)
Blake, C., Merz, C.: UCI repository of machine learning databases (1998), http://www.ics.uci.edu/~mlearn/MLRepository.html
Freund, Y., Schapire, R.: Experiments with a new boosting algorithm. In: Proceedings of the 13th Inxpternational Conference on Machine Learning, pp. 148–146. Morgan Kaufmann, San Francisco (1996)
Koza, J.: Genetic Programming. MIT Press, Cambridge (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eggermont, J., Kok, J.N., Kosters, W.A. (2004). Detecting and Pruning Introns for Faster Decision Tree Evolution. In: Yao, X., et al. Parallel Problem Solving from Nature - PPSN VIII. PPSN 2004. Lecture Notes in Computer Science, vol 3242. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30217-9_108
Download citation
DOI: https://doi.org/10.1007/978-3-540-30217-9_108
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23092-2
Online ISBN: 978-3-540-30217-9
eBook Packages: Springer Book Archive