A New Permutation-Based Method for Ranking and Selecting Group Features in Multiclass Classification

被引:1
|
作者
Zubair, Iqbal Muhammad [1 ]
Lee, Yung-Seop [2 ]
Kim, Byunghoon [1 ]
机构
[1] Hanyang Univ, Dept Ind & Management Engn, Ansan 15588, South Korea
[2] Dongguk Univ, Dept Stat, Seoul 04620, South Korea
来源
APPLIED SCIENCES-BASEL | 2024年 / 14卷 / 08期
基金
新加坡国家研究基金会;
关键词
group feature; feature selection; permutation; multiclass classification; ALGORITHMS; GENES;
D O I
10.3390/app14083156
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
The selection of group features is a critical aspect in reducing model complexity by choosing the most essential group features, while eliminating the less significant ones. The existing group feature selection methods select a set of important group features, without providing the relative importance of all group features. Moreover, few methods consider the relative importance of group features in the selection process. This study introduces a permutation-based group feature selection approach specifically designed for high-dimensional multiclass datasets. Initially, the least absolute shrinkage and selection operator (lasso) method was applied to eliminate irrelevant individual features within each group feature. Subsequently, the relative importance of the group features was computed using a random-forest-based permutation method. Accordingly, the process selected the highly significant group features. The performance of the proposed method was evaluated using machine learning algorithms and compared with the performance of other approaches, such as group lasso. We used real-world, high-dimensional, multiclass microarray datasets to demonstrate its effectiveness. The results highlighted the capability of the proposed method, which not only selected significant group features but also provided the relative importance and ranking of all group features. Furthermore, the proposed method outperformed the existing method in terms of accuracy and F1 score.
引用
收藏
页数:16
相关论文
共 50 条
  • [1] Quantized ranking for permutation-based indexing
    Mohamed, Hisham
    Marchand-Maillet, Stephane
    [J]. INFORMATION SYSTEMS, 2015, 52 : 163 - 175
  • [2] Permutation-based tests of perfect ranking
    Zamanzade, Ehsan
    Arghami, Nasser Reza
    Vock, Michael
    [J]. STATISTICS & PROBABILITY LETTERS, 2012, 82 (12) : 2213 - 2220
  • [3] Quantized Ranking for Permutation-Based Indexing
    Mohamed, Hisham
    Marchand-Maillet, Stephane
    [J]. SIMILARITY SEARCH AND APPLICATIONS (SISAP), 2013, 8199 : 103 - 114
  • [4] The Plackett-Luce Ranking Model on Permutation-based Optimization Problems
    Ceberio, Josu
    Mendiburu, Alexander
    Lozano, Jose A.
    [J]. 2013 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2013, : 494 - 501
  • [5] Permutation-based group sequential analyses for cognitive neuroscience
    Veillette, John P.
    Ho, Letitia
    Nusbaum, Howard C.
    [J]. NEUROIMAGE, 2023, 277
  • [6] Multiclass VisualRank: Image Ranking Method in Clustered Subsets Based on Visual Features
    Ambai, Mitsuru
    Yoshida, Yuichi
    [J]. PROCEEDINGS 32ND ANNUAL INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2009, : 732 - 733
  • [7] Interval-based Initialization Method for Permutation-based Problems
    Mehdi, Malika
    Melab, Nouredine
    Talbi, El-Ghazali
    Bouvry, Pascal
    [J]. 2010 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2010,
  • [8] ArMTFr: a new permutation-based image encryption scheme
    Elkamchouchi, Hassan
    Salama, Wessam M.
    Abouelseoud, Yasmine
    [J]. INTERNATIONAL JOURNAL OF ELECTRONIC SECURITY AND DIGITAL FORENSICS, 2019, 11 (01) : 1 - 28
  • [9] Re-ranking Permutation-Based Candidate Sets with the n-Simplex Projection
    Amato, Giuseppe
    Chavez, Edgar
    Connor, Richard
    Falchi, Fabrizio
    Gennaro, Claudio
    Vadicamo, Lucia
    [J]. SIMILARITY SEARCH AND APPLICATIONS, SISAP 2018, 2018, 11223 : 3 - 17
  • [10] New approach for attack of permutation-based image encryption schemes
    Mekhaznia T.
    Bennour A.
    [J]. International Journal of Computers and Applications, 2021, 43 (07) : 697 - 705