Abstract
For classification problems with ordinal attributes very often the class attribute should increase with each or some of the explanatory attributes. These are called classification problems with monotonicity constraints. Standard classification tree algorithms such as CART or C4.5 are not guaranteed to produce monotone trees, even if the data set is completely monotone. We look at pruning based methods to build monotone classification trees from monotone as well as nonmonotone data sets. We develop a number of fixing methods, that make a non-monotone tree monotone by additional pruning steps. These fixing methods can be combined with existing pruning techniques to obtain a sequence of monotone trees. The performance of the new algorithms is evaluated through experimental studies on artificial as well as real life data sets. We conclude that the monotone trees have a slightly better predictive performance and are considerably smaller than trees constructed by the standard algorithm.
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
Ben-David, A.: Monotonicity maintenance in information-theoretic machine learning algorithms. Machine Learning 19, 29–43 (1995)
Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and Regression Trees (CART). Wadsworth, Belmont (1984)
Blake, C.L., Merz, C.J.: UCI repository of machine learning databases (1998), http://www.ics.uci.edu/~mlearn/mlrepository.html
Bioch, J.C., Popova, V.: Monotone decision trees and noisy data. ERIM Report Series Research in Management, ERS-2002-53-LIS (2002)
Bioch, J.C., Popova, V.: Induction of ordinal decision trees: an MCDA approach. ERIM Report Series Research in Management, ERS-2003-008-LIS (2003)
Cao-Van, K., De Beats, B.: Growing decision trees in an ordinal setting. Submitted to International Journal of Intelligent Systems (2002)
Daniels, H.A.M., Velikova, M.: Derivation of monotone decision models from non-monotone data. Technical Report 2003-30, Center, Tilburg University (2003)
Feelders, A.J.: Prior knowledge in economic applications of data mining. In: Zighed, D.A., Komorowski, J., Zytkow, J. (eds.) PKDD 2000. LNCS (LNAI), vol. 1910, pp. 395–400. Springer, Heidelberg (2000)
Koop, G.: Analysis of Economic Data. John Wiley and Sons, Chichester (2000)
Makino, K., Susa, T., Ono, H., Ibaraki, T.: Data analysis by positive decision trees. IEICE Transactions on Information and Systems, E82-D(1) (1999)
Potharst, R., Bioch, J.C.: A decision tree algorithm for ordinal classification. In: Hand, D.J., Kok, J.N., Berthold, M.R. (eds.) IDA 1999. LNCS, vol. 1642, pp. 187–198. Springer, Heidelberg (1999)
Potharst, R., Bioch, J.C.: Decision trees for ordinal classification. Intelligent Data Analysis 4(2), 97–112 (2000)
Potharst, R., Feelders, A.: Classification trees for problems with monotonicity constraints. SIGKDD Explorations 4, 1–10 (2002)
Pompe, P.P.M.: New developments in bankruptcy prediction. PhD thesis, University of Twente (2001)
Potharst, R.: Classification using Decision Trees and Neural Nets. PhD thesis, Erasmus University Rotterdam (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Feelders, A., Pardoel, M. (2003). Pruning for Monotone Classification Trees. In: R. Berthold, M., Lenz, HJ., Bradley, E., Kruse, R., Borgelt, C. (eds) Advances in Intelligent Data Analysis V. IDA 2003. Lecture Notes in Computer Science, vol 2810. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45231-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-45231-7_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40813-0
Online ISBN: 978-3-540-45231-7
eBook Packages: Springer Book Archive