BT*: an advanced algorithm for anytime classification
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
A survey of cost-sensitive decision tree induction algorithms
ACM Computing Surveys (CSUR)
Decision trees: a recent overview
Artificial Intelligence Review
| Hi-index | 0.00 |
The classification of new cases using a predictive model incurs two types of costs--testing costs and misclassification costs. Recent research efforts have resulted in several novel algorithms that attempt to produce learners that simultaneously minimize both types. In many real life scenarios, however, we cannot afford to conduct all the tests required by the predictive model. For example, a medical center might have a fixed predetermined budget for diagnosing each patient. For cost bounded classification, decision trees are considered attractive as they measure only the tests along a single path. In this work we present an anytime framework for producing decision-tree based classifiers that can make accurate decisions within a strict bound on testing costs. These bounds can be known to the learner, known to the classifier but not to the learner, or not predetermined. Extensive experiments with a variety of datasets show that our proposed framework produces trees with lower misclassification costs along a wide range of testing cost bounds.