Test strategies for cost-sensitive decision trees

被引:87
|
作者
Ling, Charles X. [1 ]
Sheng, Victor S.
Yang, Qiang
机构
[1] Univ Western Ontario, Dept Comp Sci, London, ON N6A 5B7, Canada
[2] Hong Kong Univ Sci & Technol, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China
基金
加拿大自然科学与工程研究理事会;
关键词
induction; concept learning; mining methods and algorithms; classification;
D O I
10.1109/TKDE.2006.131
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In medical diagnosis, doctors must often determine what medical tests ( e. g., X-ray and blood tests) should be ordered for a patient to minimize the total cost of medical tests and misdiagnosis. In this paper, we design cost-sensitive machine learning algorithms to model this learning and diagnosis process. Medical tests are like attributes in machine learning whose values may be obtained at a cost ( attribute cost), and misdiagnoses are like misclassifications which may also incur a cost ( misclassification cost). We first propose a lazy decision tree learning algorithm that minimizes the sum of attribute costs and misclassification costs. Then, we design several novel "test strategies" that can request to obtain values of unknown attributes at a cost ( similar to doctors' ordering of medical tests at a cost) in order to minimize the total cost for test examples ( new patients). These test strategies correspond to different situations in real-world diagnoses. We empirically evaluate these test strategies, and show that they are effective and outperform previous methods. Our results can be readily applied to real-world diagnosis tasks. A case study on heart disease is given throughout the paper.
引用
收藏
页码:1055 / 1067
页数:13
相关论文
共 50 条
  • [21] Pessimistic cost-sensitive active learning of decision trees for profit maximizing targeting campaigns
    Rokach, Lior
    Naamani, Lihi
    Shmilovici, Armin
    DATA MINING AND KNOWLEDGE DISCOVERY, 2008, 17 (02) : 283 - 316
  • [22] Pessimistic cost-sensitive active learning of decision trees for profit maximizing targeting campaigns
    Lior Rokach
    Lihi Naamani
    Armin Shmilovici
    Data Mining and Knowledge Discovery, 2008, 17 : 283 - 316
  • [23] Cost-sensitive learning and decision making revisited
    Viaene, S
    Dedene, G
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 166 (01) : 212 - 220
  • [24] Cost-Sensitive Decision Tree for Uncertain Data
    Liu, Mingjian
    Zhang, Yang
    Zhang, Xing
    Wang, Yong
    ADVANCED DATA MINING AND APPLICATIONS, PT I, 2011, 7120 : 243 - +
  • [25] Inducing cost-sensitive trees via instance weighting
    Ting, KM
    PRINCIPLES OF DATA MINING AND KNOWLEDGE DISCOVERY, 1998, 1510 : 139 - 147
  • [26] Dynamic test-sensitive decision trees with multiple cost scales
    Qin, ZX
    Zhang, CQ
    Xie, XH
    Zhang, SC
    FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, PT 1, PROCEEDINGS, 2005, 3613 : 402 - 405
  • [27] Cost-Sensitive Decision Support for Industrial Batch Processes
    Mahlkvist, Simon
    Ejenstam, Jesper
    Kyprianidis, Konstantinos
    SENSORS, 2023, 23 (23)
  • [28] Cost-sensitive decision tree with multiple resource constraints
    Chia-Chi Wu
    Yen-Liang Chen
    Kwei Tang
    Applied Intelligence, 2019, 49 : 3765 - 3782
  • [29] Cost-sensitive decision tree learning for forensic classification
    Davis, Jason V.
    Ha, Jungwoo
    Rossbach, Christopher J.
    Ramadan, Hany E.
    Witchel, Emmett
    MACHINE LEARNING: ECML 2006, PROCEEDINGS, 2006, 4212 : 622 - 629
  • [30] A cost-sensitive decision tree approach for fraud detection
    Sahin, Yusuf
    Bulkan, Serol
    Duman, Ekrem
    EXPERT SYSTEMS WITH APPLICATIONS, 2013, 40 (15) : 5916 - 5923