Ranking Cases with Decision Trees: a Geometric Method that Preserves Intelligibility
Résumé
This paper proposes a new method to rank the cases classified by a decision tree. The method applies a posteriori without modification of the tree and doesn’t use additional training cases. It consists in computing the distance of the cases to the decision boundary induced by the decision tree, and to rank them according to this geometric score. When the data are numeric it is very easy to implement and efficient. The distance-based score is a global assess, contrary to other methods that evaluate the score at the level of the leaf. The distance-based score gives good results even with pruned tree, so if the tree is intelligible this property is preserved with an improved ranking ability. The main reason for the efficacity of the geometric method is that in most cases when the classifier is sufficiently accurate, errors are located near the decision boundary.