Feature Subset Selection based on Redundancy Maximized Clusters

被引:3
|
作者
Tarek, Md Hasan [1 ]
Kadir, Md Eusha [1 ]
Sharmin, Sadia [2 ]
Sajib, Abu Ashfaqur [3 ]
Ali, Amin Ahsan [2 ]
Shoyaib, Mohammad [1 ]
机构
[1] Univ Dhaka, Inst Informat Technol, Dhaka, Bangladesh
[2] Islamic Univ Technol, Comp Sci & Engn, Gazipur, Bangladesh
[3] Univ Dhaka, Genet Engn & Biotechnol, Dhaka, Bangladesh
关键词
Clustering; Normalized mutual information; Bias correction; Feature selection; CHRONIC LYMPHOCYTIC-LEUKEMIA; MUTUAL INFORMATION; ALGORITHMS;
D O I
10.1109/ICMLA52953.2021.00087
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Feature selection plays a vital role in the field of data mining and machine learning for analyzing high-dimensional data. A popular criteria for feature selection is Mutual Information (MI) as it can capture both the linear and non-linear relationship among different features and class variable. Existing MI based feature selection methods use different approximation techniques to capture the joint performance of features, their relationship with the classes and eliminate the redundant features. However, these approximations may fail to select the optimal set of features, especially when the feature dimension is high. Besides, due to the absence of an appropriate searching strategy, these MI based approximations may select unnecessary features. To address these issues, we propose a method namely Feature Selection based on Redundancy maximized Clusters (FSRC) that creates the clusters of redundant features and then selects a subset of representative features from each cluster. We also propose to use bias corrected normalized MI in this regard. Rigorous experiments performed on thirty benchmark datasets demonstrate that FSRC outperforms the existing state-of-the-art methods in most of the cases. Moreover, FSRC is applied to three gene expression datasets which are high-dimensional but small sample datasets. The result shows that FSRC can select the features (genes) that are not only discriminating but also biologically relevant.
引用
收藏
页码:521 / 526
页数:6
相关论文
共 50 条
  • [21] Ensembles of instance selection methods based on feature subset
    Blachnik, Marcin
    KNOWLEDGE-BASED AND INTELLIGENT INFORMATION & ENGINEERING SYSTEMS 18TH ANNUAL CONFERENCE, KES-2014, 2014, 35 : 388 - 396
  • [22] Feature subset selection: A correlation based filter approach
    Hall, MA
    Smith, LA
    PROGRESS IN CONNECTIONIST-BASED INFORMATION SYSTEMS, VOLS 1 AND 2, 1998, : 855 - 858
  • [23] Bandit-based local feature subset selection
    Ashtiani, Mohammad-Hassan Zokaei
    Ahmadabadi, Majid Nili
    Araabi, Babak Nadjar
    NEUROCOMPUTING, 2014, 138 : 371 - 382
  • [24] Feature subset selection in SOM based text categorization
    Bassiouny, S
    Nagi, M
    Hussein, MF
    IC-AI '04 & MLMTA'04 , VOL 1 AND 2, PROCEEDINGS, 2004, : 860 - 866
  • [25] A new improved maximal relevance and minimal redundancy method based on feature subset
    Shanshan Xie
    Yan Zhang
    Danjv Lv
    Xu Chen
    Jing Lu
    Jiang Liu
    The Journal of Supercomputing, 2023, 79 : 3157 - 3180
  • [26] Feature transformation and subset selection
    Liu, H
    Motoda, H
    IEEE INTELLIGENT SYSTEMS & THEIR APPLICATIONS, 1998, 13 (02): : 26 - 28
  • [27] A new improved maximal relevance and minimal redundancy method based on feature subset
    Xie, Shanshan
    Zhang, Yan
    Lv, Danjv
    Chen, Xu
    Lu, Jing
    Liu, Jiang
    JOURNAL OF SUPERCOMPUTING, 2023, 79 (03): : 3157 - 3180
  • [28] Feature transformation and subset selection
    Natl Univ of Singapore, Singapore, Singapore
    IEEE Intell Syst their Appl, 2 (26-28):
  • [29] Wrappers for feature subset selection
    Kohavi, R
    John, GH
    ARTIFICIAL INTELLIGENCE, 1997, 97 (1-2) : 273 - 324
  • [30] THE FEATURE SUBSET SELECTION ALGORITHM
    Liu Yongguo Li Xueming Wu Zhongfu (Department of Computer Science and Engineering
    Journal of Electronics(China), 2003, (01) : 57 - 61