A Novel Selective Ensemble Algorithm for Imbalanced Data Classification Based on Exploratory Undersampling

被引:11
|
作者
Yin, Qing-Yan [1 ]
Zhang, Jiang-She [1 ]
Zhang, Chun-Xia [1 ]
Ji, Nan-Nan [1 ]
机构
[1] Xi An Jiao Tong Univ, Sch Math & Stat, Xian 710049, Peoples R China
基金
中国国家自然科学基金;
关键词
D O I
10.1155/2014/358942
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Learning with imbalanced data is one of the emergent challenging tasks in machine learning. Recently, ensemble learning has arisen as an effective solution to class imbalance problems. The combination of bagging and boosting with data preprocessing resampling, namely, the simplest and accurate exploratory undersampling, has become the most popular method for imbalanced data classification. In this paper, we propose a novel selective ensemble construction method based on exploratory undersampling, RotEasy, with the advantage of improving storage requirement and computational efficiency by ensemble pruning technology. Our methodology aims to enhance the diversity between individual classifiers through feature extraction and diversity regularized ensemble pruning. We made a comprehensive comparison between our method and some state-of-the-art imbalanced learning methods. Experimental results on 20 real-world imbalanced data sets show that RotEasy possesses a significant increase in performance, contrasted by a nonparametric statistical test and various evaluation criteria.
引用
收藏
页数:14
相关论文
共 50 条
  • [1] Radial-Based Undersampling for imbalanced data classification
    Koziarski, Michal
    [J]. PATTERN RECOGNITION, 2020, 102
  • [2] Hashing-Based Undersampling Ensemble for Imbalanced Pattern Classification Problems
    Ng, Wing W. Y.
    Xu, Shichao
    Zhang, Jianjun
    Tian, Xing
    Rong, Tongwen
    Kwong, Sam
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2022, 52 (02) : 1269 - 1279
  • [3] Ensemble classification algorithm based improved SMOTE for imbalanced data
    [J]. Ning, Liu, 1600, Natsional'nyi Hirnychyi Universytet
  • [4] A Membership Probability–Based Undersampling Algorithm for Imbalanced Data
    Gilseung Ahn
    You-Jin Park
    Sun Hur
    [J]. Journal of Classification, 2021, 38 : 2 - 15
  • [5] Overlap-Based Undersampling for Improving Imbalanced Data Classification
    Vuttipittayamongkol, Pattaramon
    Elyan, Eyad
    Petrovski, Andrei
    Jayne, Chrisina
    [J]. INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING - IDEAL 2018, PT I, 2018, 11314 : 689 - 697
  • [6] Adaptive Ensemble Undersampling-Boost: A novel learning framework for imbalanced data
    Lu, Wei
    Li, Zhe
    Chu, Jinghui
    [J]. JOURNAL OF SYSTEMS AND SOFTWARE, 2017, 132 : 272 - 282
  • [7] A Membership Probability-Based Undersampling Algorithm for Imbalanced Data
    Ahn, Gilseung
    Park, You-Jin
    Hur, Sun
    [J]. JOURNAL OF CLASSIFICATION, 2021, 38 (01) : 2 - 15
  • [8] Evolutionary Undersampling for Imbalanced Big Data Classification
    Triguero, I.
    Galar, M.
    Vluymans, S.
    Cornelis, C.
    Bustince, H.
    Herrera, F.
    Saeys, Y.
    [J]. 2015 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2015, : 715 - 722
  • [9] A New Optimal Ensemble Algorithm Based on SVDD Sampling for Imbalanced Data Classification
    Pirgazi, Jamshid
    Pirmohammadi, Abbas
    Shams, Reza
    [J]. INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2021, 35 (06)
  • [10] WEIGHTED ENSEMBLE OF DIVERSIFIED SENSITIVITY-BASED UNDERSAMPLING FOR IMBALANCED PATTERN CLASSIFICATION PROBLEMS
    Chai, Yulin
    Zhang, Jianjun
    Ng, Wing W. Y.
    [J]. PROCEEDINGS OF 2017 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS (ICMLC), VOL 1, 2017, : 42 - 47