Weighted ROC Curve in Cost Space: Extending AUC to Cost-Sensitive Learning

被引:0
|
作者
Shao, Huiyang [1 ,2 ]
Xu, Qianqian [1 ]
Yang, Zhiyong [2 ]
Wen, Peisong [1 ,2 ]
Gao, Peifeng [2 ]
Huang, Qingming [1 ,2 ,3 ]
机构
[1] Chinese Acad Sci, Inst Comp Tech, Key Lab Intelligent Informat Proc, Beijing, Peoples R China
[2] Univ Chinese Acad Sci, Sch Comp Sci & Tech, Beijing, Peoples R China
[3] Univ Chinese Acad Sci, BDKM, Beijing, Peoples R China
基金
中国国家自然科学基金; 国家重点研发计划;
关键词
AREA; BILEVEL; PERFORMANCE;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we aim to tackle flexible cost requirements for long-tail datasets, where we need to construct a (1) cost-sensitive and (2) class-distribution robust learning framework. The misclassification cost and the area under the ROC curve (AUC) are popular metrics for (1) and (2), respectively. However, limited by their formulations, models trained with AUC are not well-suited for cost-sensitive decision problems, and models trained with fixed costs are sensitive to the class distribution shift. To address this issue, we present a new setting where costs are treated like a dataset to deal with arbitrarily unknown cost distributions. Moreover, we propose a novel weighted version of AUC where the cost distribution can be integrated into its calculation through decision thresholds. To formulate this setting, we propose a novel bilevel paradigm to bridge weighted AUC (WAUC) and cost. The inner-level problem approximates the optimal threshold from sampling costs, and the outer-level problem minimizes the WAUC loss over the optimal threshold distribution. To optimize this bilevel paradigm, we employ a stochastic optimization algorithm (SACCL) which enjoys the same convergence rate (O(epsilon(-4))) with the SGD. Finally, experiment results show that our algorithm performs better than existing cost-sensitive learning methods and two-stage AUC decisions approach.
引用
收藏
页数:12
相关论文
共 50 条
  • [1] Weighted Learning Vector Quantization to Cost-Sensitive Learning
    Chen, Ning
    Ribeiro, Bernardete
    Vieira, Armando
    Duarte, Joao
    Neves, Joao
    ARTIFICIAL NEURAL NETWORKS (ICANN 2010), PT III, 2010, 6354 : 277 - +
  • [2] Cost-Sensitive Learning
    Zhou, Zlii-Hua
    MODELING DECISIONS FOR ARTIFICIAL INTELLIGENCE, MDAI 2011, 2011, 6820 : 17 - 18
  • [3] A weighted rough set approach for cost-sensitive learning
    Liu, Jinfu
    Yu, Daren
    ROUGH SETS, FUZZY SETS, DATA MINING AND GRANULAR COMPUTING, PROCEEDINGS, 2007, 4482 : 355 - +
  • [4] The Multiclass ROC Front method for cost-sensitive classification
    Bernard, Simon
    Chatelain, Clement
    Adam, Sebastien
    Sabourin, Robert
    PATTERN RECOGNITION, 2016, 52 : 46 - 60
  • [5] Cost-Sensitive Learning to Rank
    McBride, Ryan
    Wang, Ke
    Ren, Zhouyang
    Li, Wenyuan
    THIRTY-THIRD AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FIRST INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / NINTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2019, : 4570 - 4577
  • [6] Active Cost-Sensitive Learning
    Margineantu, Dragos D.
    19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05), 2005, : 1622 - 1623
  • [7] ROC-based cost-sensitive classification with a reject option
    Dubos, Clement
    Bernard, Simon
    Adam, Sebastien
    Sabourin, Robert
    2016 23RD INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION (ICPR), 2016, : 3320 - 3325
  • [8] Active Learning for Cost-Sensitive Classification
    Krishnamurthy, Akshay
    Agarwal, Alekh
    Huang, Tzu-Kuo
    Daume, Hal, III
    Langford, John
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 70, 2017, 70
  • [9] Cost-sensitive learning of SVM for ranking
    Xu, Jun
    Cao, Yunbo
    Li, Hang
    Huang, Yalou
    MACHINE LEARNING: ECML 2006, PROCEEDINGS, 2006, 4212 : 833 - 840
  • [10] Cost-Sensitive Learning in Answer Extraction
    Wiegand, Michael
    Leidner, Jochen L.
    Klakow, Dietrich
    SIXTH INTERNATIONAL CONFERENCE ON LANGUAGE RESOURCES AND EVALUATION, LREC 2008, 2008, : 711 - 714