Learning decision trees for loss minimization in multi-class problems
By: Dragos D. Margineantu, Thomas G. Dietterich.
Contributors: Dietterich, Thomas Glen.; Oregon State University. Dept. of Computer Science.
Series: Technical report -- 99-30-03.; Technical report (Oregon State University. Dept. of Computer Science) -- 99-30-03.
Publisher: Oregon State University, Dept. of Computer Science
Published: 1999
Place of publication: [Corvallis, OR
Language: eng
Number of pages: 14
Subjects: Machine learning.; Decision trees.
Description: Many machine learning applications require classifiers that minimize an asymmetric loss function rather than the raw misclassification rate. We study methods for modifying C4.5 to incorporate arbitrary loss matrices. One way to incorporate loss information into C4.5 is to manipulate the weights assigned to the examples from different classes. For 2-class problems, this works for any loss matrix, but for k > 2 classes, it is not sufficient. Nonetheless, we ask what is the set of class weights that best approximates an arbitrary k x k loss matrix, and we test and compare several methods: a wrapper method and some simple heuristics. The best method is a wrapper method that directly optimizes the loss using a holdout data set. We define complexity measure for loss matrices and show that this measure can predict when more efficient methods will suffice and when the wrapper method must be applied.
Notes: Caption title.

Includes bibliographical references (leaves: 11-12).

Also issued online.