Building classification trees using the total uncertainty criterion

✍ Scribed by Joaquín Abellán; Serafín Moral

• Publisher: John Wiley and Sons
• Year: 2003
• Tongue: English
• Weight: 90 KB
• Volume: 18
• Category: Article
• ISSN: 0884-8173
• DOI: 10.1002/int.10143

✦ Synopsis

We present an application of the measure of total uncertainty on convex sets of probability distributions, also called credal sets, to the construction of classification trees. In these classification trees the probabilities of the classes in each one of its leaves is estimated by using the imprecise Dirichlet model. In this way, smaller samples give rise to wider probability intervals. Branching a classification tree can decrease the entropy associated with the classes but, at the same time, as the sample is divided among the branches the nonspecificity increases. We use a total uncertainty measure (entropy ϩ nonspecificity) as branching criterion. The stopping rule is not to increase the total uncertainty. The good behavior of this procedure for the standard classification problems is shown. It is important to remark that it does not experience of overfitting, with similar results in the training and test samples.