Cost-sensitive selection of variables by ensemble of model sequences

被引:0
|
作者
Yan, Donghui [1 ,2 ]
Qin, Zhiwei [3 ]
Gu, Songxiang [4 ]
Xu, Haiping [5 ]
Shao, Ming [5 ]
机构
[1] Univ Massachusetts, Dept Math, Dartmouth, MA 02747 USA
[2] Univ Massachusetts, Program Data Sci, Dartmouth, MA 02747 USA
[3] DiDi Res Amer, Mountain View, CA USA
[4] JD Digital, Mountain View, CA USA
[5] Univ Massachusetts, Dept Comp & Informat Sci, Dartmouth, MA USA
关键词
Metrics selection; Cost-sensitive; Budget; Ensemble; Model schedule; Classification; REGULARIZATION; REGRESSION;
D O I
10.1007/s10115-021-01551-x
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Many applications require the collection of data on different variables or measurements over many system performance metrics. We term those broadly as measures or variables. Often data collection along each measure incurs a cost, thus it is desirable to consider the cost of measures in modeling. This is a fairly new class of problems in the area of cost-sensitive learning. A few attempts have been made to incorporate costs in combining and selecting measures. However, existing studies either do not strictly enforce a budget constraint, or are not the 'most' cost effective. With a focus on classification problems, we propose a computationally efficient approach that could find a near optimal model under a given budget by exploring the most 'promising' part of the solution space. Instead of outputting a single model, we produce a model schedule-a list of models, sorted by model costs and expected predictive accuracy. This could be used to choose the model with the best predictive accuracy under a given budget, or to trade off between the budget and the predictive accuracy. Experiments on some benchmark datasets show that our approach compares favorably to competing methods.
引用
收藏
页码:1069 / 1092
页数:24
相关论文
共 50 条
  • [21] Cost-sensitive learning for imbalanced data streams
    Loezer, Lucas
    Enembreck, Fabricio
    Barddal, Jean Paul
    Britto Jr, Alceu de Souza
    PROCEEDINGS OF THE 35TH ANNUAL ACM SYMPOSIUM ON APPLIED COMPUTING (SAC'20), 2020, : 498 - 504
  • [22] Cost-Sensitive Feature Selection for Class Imbalance Problem
    Bach, Malgorzata
    Werner, Aleksandra
    INFORMATION SYSTEMS ARCHITECTURE AND TECHNOLOGY, PT I, 2018, 655 : 182 - 194
  • [23] Cost-sensitive business failure prediction when misclassification costs are uncertain: A heterogeneous ensemble selection approach
    De Bock, Koen W.
    Coussement, Kristof
    Lessmann, Stefan
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 285 (02) : 612 - 630
  • [24] Cost-sensitive Feature Selection for Support Vector Machines
    Benitez-Pena, S.
    Blanquero, R.
    Carrizosa, E.
    Ramirez-Cobo, P.
    COMPUTERS & OPERATIONS RESEARCH, 2019, 106 : 169 - 178
  • [25] Cost-sensitive stacking ensemble learning for company financial distress prediction
    Wang, Shanshan
    Chi, Guotai
    EXPERT SYSTEMS WITH APPLICATIONS, 2024, 255
  • [26] Breast cancer recurrence prediction with ensemble methods and cost-sensitive learning
    Yang, Pei-Tse
    Wu, Wen-Shuo
    Wu, Chia-Chun
    Shih, Yi-Nuo
    Hsieh, Chung-Ho
    Hsu, Jia-Lien
    OPEN MEDICINE, 2021, 16 (01): : 754 - 768
  • [27] Conformational B-Cell Epitopes Prediction from Sequences Using Cost-Sensitive Ensemble Classifiers and Spatial Clustering
    Zhang, Jian
    Zhao, Xiaowei
    Sun, Pingping
    Gao, Bo
    Ma, Zhiqiang
    BIOMED RESEARCH INTERNATIONAL, 2014, 2014
  • [28] Cost-Sensitive Boosting
    Masnadi-Shirazi, Hamed
    Vasconcelos, Nuno
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (02) : 294 - 309
  • [29] Cost-Sensitive Feature Selection for On-Body Sensor Localization
    Saeedi, Ramyar
    Schimert, Brian
    Ghasemzadeh, Hassan
    PROCEEDINGS OF THE 2014 ACM INTERNATIONAL JOINT CONFERENCE ON PERVASIVE AND UBIQUITOUS COMPUTING (UBICOMP'14 ADJUNCT), 2014, : 833 - 842
  • [30] Cost-sensitive SVDD models based on a sample selection approach
    Zhao, Zhenchong
    Wang, Xiaodan
    APPLIED INTELLIGENCE, 2018, 48 (11) : 4247 - 4266