Improving the readability of decision trees using reduced complexity feature extraction

Authors:
Cesar Fernandez;Sampsa Laine;Oscar Reinoso;M. Asuncion Vicente
Affiliations:
Miguel Hernandez University, Av. Universidad, Elche, Spain;Helsinki University of Technology, Hut, Finland;Miguel Hernandez University, Av. Universidad, Elche, Spain;Miguel Hernandez University, Av. Universidad, Elche, Spain
Venue:
IEA/AIE'2005 Proceedings of the 18th international conference on Innovations in Applied Artificial Intelligence
Year:
2005

Citing 3
Cited 0

C4.5: programs for machine learning

C4.5: programs for machine learning
Linear Discriminant Trees

ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Omnivariate decision trees

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

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.