A reinforcement learning guided adaptive cost-sensitive feature acquisition method

被引:0
|
作者
An, Chaojie
Zhou, Qifeng [1 ]
Yang, Shen
机构
[1] Xiamen Univ, Dept Automat, Xiamen, Peoples R China
关键词
Cost-sensitive; Feature acquisition; Recurrent neural network; Reinforcement learning; FEATURE-SELECTION; MUTUAL INFORMATION;
D O I
10.1016/j.asoc.2022.108437
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Most of the existing feature selection methods tend to pursue the learning performance of the selected feature subset while ignoring the costs of acquiring each feature. However, in real-world problems, we often face the tradeoff between model performance and feature costs because of limited resources. Moreover, in some applications (e.g. medical tests), features are acquired sequentially in the learning process instead of having known the information of the whole feature set in advance. To solve these problems we design a reinforcement learning agent to guide the cost-sensitive feature acquisition process and propose a deep learning-based model to select the informative and lower-cost features for each instance adaptively. The whole process of feature acquisition will be determined by an agent according to what it has observed from inputs. In particular, a Recurrent Neural Network (RNN) model will learn the knowledge from the current sample and the agent will give the instructions on whether the RNN model will continue to select the next feature or stop the sequential feature acquisition process. Moreover, the proposed method can also select the features per block thus it can deal with high dimensional data. We evaluate the effectiveness of the proposed method on a variety of datasets including benchmark datasets, gene datasets, and medical datasets. Compared with the state-of-the-art feature selection methods, the proposed method can achieve comparable learning accuracy while maintaining lower feature costs. (C)& nbsp;2022 Elsevier B.V. All rights reserved.
引用
收藏
页数:10
相关论文
共 50 条
  • [1] Sequential Cost-Sensitive Feature Acquisition
    Contardo, Gabriella
    Denoyer, Ludovic
    Artieres, Thierry
    ADVANCES IN INTELLIGENT DATA ANALYSIS XV, 2016, 9897 : 284 - 294
  • [2] Cost-sensitive feature acquisition and classification
    Ji, Shihao
    Carin, Lawrence
    PATTERN RECOGNITION, 2007, 40 (05) : 1474 - 1485
  • [3] Cost-sensitive reinforcement learning for credit risk
    C-Rella, Jorge
    Rego, David Martinez
    Vilar, Juan M.
    EXPERT SYSTEMS WITH APPLICATIONS, 2025, 272
  • [4] Cost-Sensitive Trees for Interpretable Reinforcement Learning
    Nishtala, Siddharth
    Ravindran, Balaraman
    PROCEEDINGS OF 7TH JOINT INTERNATIONAL CONFERENCE ON DATA SCIENCE AND MANAGEMENT OF DATA, CODS-COMAD 2024, 2024, : 91 - 99
  • [5] Partial Example Acquisition in Cost-Sensitive Learning
    Sheng, Victor S.
    Ling, Charles X.
    KDD-2007 PROCEEDINGS OF THE THIRTEENTH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2007, : 638 - 646
  • [6] Applying Cost-Sensitive Classifiers with Reinforcement Learning to IDS
    Blanco, Roberto
    Cilla, Juan J.
    Briongos, Samira
    Malagon, Pedro
    Moya, Jose M.
    INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING - IDEAL 2018, PT I, 2018, 11314 : 531 - 538
  • [7] An Effective Imbalanced JPEG Steganalysis Scheme Based on Adaptive Cost-Sensitive Feature Learning
    Jia, Ju
    Zhai, Liming
    Ren, Weixiang
    Wang, Lina
    Ren, Yanzhen
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2022, 34 (03) : 1038 - 1052
  • [8] Cost-sensitive feature selection based on Adaptive Hunting Optimization
    Liang, Yixuan
    2024 4TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATION AND ARTIFICIAL INTELLIGENCE, CCAI 2024, 2024, : 546 - 551
  • [9] Cost-Sensitive Learning
    Zhou, Zlii-Hua
    MODELING DECISIONS FOR ARTIFICIAL INTELLIGENCE, MDAI 2011, 2011, 6820 : 17 - 18
  • [10] Adaptive learning cost-sensitive convolutional neural network
    Hou, Yun
    Fan, Hong
    Li, Li
    Li, Bailin
    IET COMPUTER VISION, 2021, 15 (05) : 346 - 355