A survey of cost-sensitive decision tree induction algorithms

146Citations
Citations of this article
190Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The past decade has seen a significant interest on the problem of inducing decision trees that take account of costs of misclassification and costs of acquiring the features used for decision making. This survey identifies over 50 algorithms including approaches that are direct adaptations of accuracy-based methods, use genetic algorithms, use anytime methods and utilize boosting and bagging. The survey brings together these different studies and novel approaches to cost-sensitive decision tree learning, provides a useful taxonomy, a historical timeline of how the field has developed and should provide a useful reference point for future research in this field. © 2013 ACM.

Cite

CITATION STYLE

APA

Lomax, S., & Vadera, S. (2013, February). A survey of cost-sensitive decision tree induction algorithms. ACM Computing Surveys. https://doi.org/10.1145/2431211.2431215

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free