Abstract
Understandability of decision trees depends on two key factors: the size of the trees and the complexity of their node functions. Most of the attempts to improve the behavior of decision trees have been focused only on reducing their sizes by building the trees on complex features. These features are usually linear or non-linear functions of all the original attributes. In this paper, reduced complexity features are proposed as a way to reduce the size of decision trees while keeping understandable functions at their nodes. The proposed approach is tested on a robot grasping application where the goal is to obtain a system able to classify grasps as valid or invalid and also on three datasets from the UCI repository.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Perner, P.: Improving the Accuracy of Decision Tree Induction by Feature Pre-Selection. Applied Artificial Intelligence 15(8), 747–760 (2001)
Liu, H., Setiono, R.: Feature Transformation and Multivariate Decision Tree Induction. In: Proc. 1st Int. Conf. on Discovery Science, pp. 14–16 (1998)
Murthy, S.K., Kasif, S., Salzberg, S.: A System for Induction of Oblique Decision Trees. Journal of Artificial Intelligence Research 2, 1–32 (1994)
Yildiz, O.T., Alpaydin, E.: Linear Discriminant Trees. In: Proc. of the 17th Int. Conf. on Machine Learning, pp. 1175–1182 (2000)
Yildiz, O.T., Alpaydin, E.: Omnivariate Decision Trees. IEEE Transactions on Neural Networks 12(6), 1539–1546 (2001)
Fernandez, C., Vicente, M.A., Reinoso, O., Aracil, R.: A Decision Tree Based Approach to Grasp Synthesis. In: Proc. Int. Conf. on Intelligent Manipulation and Grasping, pp. 486–491 (2004)
Blake, C.L., Merz, C.J.: UCI Repository of machine learning databases (1998), http://www.ics.uci.edu/mlearn/MLRepository.html
Quinlan, J.R.: C4.5: Programs for Machine Learning. M. Kaufmann Publ. Inc, San Francisco (1993)
Fernandez, C., Laine, S., Reinoso, O., Vicente, M.A.: Towards supervised and readable decision trees (2004), http://lorca.umh.es/isa/es/personal/c.fernandez/dtrees
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fernandez, C., Laine, S., Reinoso, O., Vicente, M.A. (2005). Improving the Readability of Decision Trees Using Reduced Complexity Feature Extraction. In: Ali, M., Esposito, F. (eds) Innovations in Applied Artificial Intelligence. IEA/AIE 2005. Lecture Notes in Computer Science(), vol 3533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11504894_61
Download citation
DOI: https://doi.org/10.1007/11504894_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26551-1
Online ISBN: 978-3-540-31893-4
eBook Packages: Computer ScienceComputer Science (R0)