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 条
  • [21] A MIN-MAX THEOREM ON POTENTIALS
    KAUFMAN, R
    COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1994, 319 (08): : 799 - 800
  • [22] MORE ON MIN-MAX ALLOCATION
    PORTEUS, EL
    YORMARK, JS
    MANAGEMENT SCIENCE SERIES A-THEORY, 1972, 18 (09): : 502 - 507
  • [23] MIN-MAX INTERVAL CALCULUS
    JAHN, KU
    MATHEMATISCHE NACHRICHTEN, 1976, 71 : 267 - 272
  • [24] Min-max multiway cut
    Svitkina, Z
    Tardos, É
    APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, PROCEEDINGS, 2004, 3122 : 207 - 218
  • [25] SYNTHESIS OF MIN-MAX STRATEGIES
    GUTMAN, S
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1985, 46 (04) : 515 - 523
  • [26] A min-max theorem on tournaments
    Chen, Xujin
    Hu, Xiaodong
    Zang, Wenan
    SIAM JOURNAL ON COMPUTING, 2007, 37 (03) : 923 - 937
  • [27] Dynamic min-max problems
    Schwiegelshohn, U
    Thiele, L
    DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 1999, 9 (02): : 111 - 134
  • [28] Min-max kalman filtering
    Yaesh, I
    Shaked, U
    SYSTEMS & CONTROL LETTERS, 2004, 53 (3-4) : 217 - 228
  • [29] BOUNDS FOR MIN-MAX HEAPS
    HASHAM, A
    SACK, JR
    BIT, 1987, 27 (03): : 315 - 323
  • [30] On a min-max theorem of cacti
    Szigeti, Z
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1998, 1412 : 84 - 95