Min-Max Ensemble Feature Selection

被引:1
|
作者
Ji, Wei [1 ]
Huang, Yixiang [2 ]
Qiang, Baohua [3 ]
Li, Yun [2 ]
机构
[1] Nanjing Univ Posts & Telecommun, Sch Telecommun & Informat Engn, Nanjing, Jiangsu, Peoples R China
[2] Nanjing Univ Posts & Telecommun, Sch Comp Sci, Nanjing, Jiangsu, Peoples R China
[3] Guilin Univ Elect Technol, Key Lab Cloud Comp & Complex Syst, Guilin, Peoples R China
基金
中国国家自然科学基金;
关键词
Feature selection; Min-Max strategy; ensemble; data partition;
D O I
10.3233/JIFS-162431
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Feature selection is one of the key problems in machine learning and data mining. It involves identifying a subset of the most useful features that produces compatible results as the original entire set of features. It can reduce the dimensionality of original data, speed up the learning process and build comprehensible learning models with good generalization performance. Nowadays, ensemble idea has been used to improve the performance of feature selection by integrating multiple base feature selection models into an ensemble one. In this paper, in order to improve the efficiency of feature selection in dealing with large scale, high dimension and imbalanced problems, a Min-Max Ensemble Feature Selection (M2-EFS) is proposed, which is based on balanced data partition and min-max ensemble strategy. The experimental results demonstrate that the M2-EFS can obtain higher performance than other classical ensemble methods in most cases, especially for large scale, high dimension and imbalanced data.
引用
收藏
页码:3441 / 3450
页数:10
相关论文
共 50 条
  • [41] On Min-Max Pair in Tournaments
    Lu, Xiaoyun
    GRAPHS AND COMBINATORICS, 2018, 34 (04) : 613 - 618
  • [42] MIN-MAX FOR MULTIPLE CRITERIA
    DRAGUSIN, C
    RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 1978, 12 (02): : 169 - 180
  • [43] Dynamic Min-Max Problems
    Uwe Schwiegelshohn
    Lothar Thiele
    Discrete Event Dynamic Systems, 1999, 9 : 111 - 134
  • [44] Parallelized extreme learning machine ensemble based on min-max modular network
    Wang, Xiao-Lin
    Chen, Yang-Yang
    Zhao, Hai
    Lu, Bao-Liang
    NEUROCOMPUTING, 2014, 128 : 31 - 41
  • [45] Improving the Fuzzy Min-Max neural network performance with an ensemble of clustering trees
    Seera, Manjeevan
    Randhawa, Kuldeep
    Lim, Chee Peng
    NEUROCOMPUTING, 2018, 275 : 1744 - 1751
  • [46] Local Approximability of Max-Min and Min-Max Linear Programs
    Patrik Floréen
    Marja Hassinen
    Joel Kaasinen
    Petteri Kaski
    Topi Musto
    Jukka Suomela
    Theory of Computing Systems, 2011, 49 : 672 - 697
  • [47] Local Approximability of Max-Min and Min-Max Linear Programs
    Floreen, Patrik
    Hassinen, Marja
    Kaasinen, Joel
    Kaski, Petteri
    Musto, Topi
    Suomela, Jukka
    THEORY OF COMPUTING SYSTEMS, 2011, 49 (04) : 672 - 697
  • [48] Gumbel central limit theorem for max-min and min-max
    Eliazar, Iddo
    Metzler, Ralf
    Reuveni, Shlomi
    PHYSICAL REVIEW E, 2019, 100 (02)
  • [49] A unified framework for max-min and min-max fairness with applications
    Radunovic, Bozidar
    Le Boudec, Jean-Yves
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2007, 15 (05) : 1073 - 1083
  • [50] Optimal Encodings for Range Top-k, Selection, and Min-Max
    Gawrychowski, Pawel
    Nicholson, Patrick K.
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2015, 9134 : 593 - 604