A Survey of Cost-Sensitive Decision Tree Induction Algorithms

被引:152
作者
Lomax, Susan [1 ]
Vadera, Sunil [1 ]
机构
[1] Univ Salford, Salford M5 4WT, Lancs, England
关键词
Algorithms; Decision tree learning; cost-sensitive learning; data mining; TEST STRATEGIES; CLASSIFICATION; KNOWLEDGE;
D O I
10.1145/2431211.2431215
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页数:35
相关论文
共 90 条
  • [1] Abe N., 2004, Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, P3
  • [2] Afifi A.A., 1996, COMPUTER AIDED MULTI, V3rd
  • [3] Ailing Ni., 2005, Asian Journal of Information Technology, V4, P1080
  • [4] [Anonymous], P 21 INT C MACH LEAR
  • [5] [Anonymous], 2014, C4. 5: programs for machine learning
  • [6] [Anonymous], 1984, OLSHEN STONE CLASSIF, DOI 10.2307/2530946
  • [7] [Anonymous], THESIS
  • [8] [Anonymous], INT JOINT C ART INT
  • [9] [Anonymous], 1983, MACHINE LEARNING ART
  • [10] An empirical comparison of voting classification algorithms: Bagging, boosting, and variants
    Bauer, E
    Kohavi, R
    [J]. MACHINE LEARNING, 1999, 36 (1-2) : 105 - 139