Abstract: Usually, data mining projects that are based on decision trees for classifying test cases will use the probabilities provided by these decision trees for ranking classified test cases. We have a need for a better method for ranking test cases that have already been classified by a binary decision tree because these probabilities are not always accurate and reliable enough. A reason for this is that the probability estimates computed by existing decision tree algorithms are always the same for all the different cases in a particular leaf of the decision tree. This is only one reason why the probability estimates given by decision tree algorithms can not be used as an accurate means of deciding if a test case has been correctly classified. Isabelle Alvarez has proposed a new method that could be used to rank the test cases that were classified by a binary decision tree Alvarez, 2004. In this paper we will give the results of a comparison of different ranking methods that are based on the probability estimate, the sensitivity of a particular case or both.

ACM Classification Keywords: I.2.6 Learning – induction, concept learning; I.5.2 Classifier design and Evaluation

Link:

USING SENSITIVITY AS A METHOD FOR RANKING THE TEST CASES CLASSIFIED BY BINARY DECISION TREES

Sabrina Noblesse, Koen Vanhoof

http://www.foibg.com/ijita/vol13/ijita13-1-p01.pdf