A novel feature selection method considering feature interaction in neighborhood rough set

被引:6
作者
Wang, Wenjing [1 ]
Guo, Min [1 ]
Han, Tongtong [1 ]
Ning, Shiyong [1 ,2 ]
机构
[1] Harbin Univ Commerce, Sch Comp & Informat Engn, Harbin, Heilongjiang, Peoples R China
[2] Heilongjiang Prov Key Lab Elect Commerce & Inform, Harbin, Heilongjiang, Peoples R China
关键词
Feature selection; feature interaction; neighborhood rough set; neighborhood symmetrical uncertainty; EFFICIENT FEATURE-SELECTION; ATTRIBUTE REDUCTION; MUTUAL INFORMATION; RELEVANCE;
D O I
10.3233/IDA-216447
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Feature selection has been shown to be a highly valuable strategy in data mining, pattern recognition, and machine learning. However, the majority of proposed feature selection methods do not account for feature interaction while calculating feature correlations. Interactive features are those features that have less individual relevance with the class, but can provide more joint information for the class when combined with other features. Inspired by it, a novel feature selection algorithm considering feature relevance, redundancy, and interaction in neighborhood rough set is proposed. First of all, a new method of information measurement called neighborhood symmetric uncertainty is proposed, to measure what proportion data a feature contains regarding category label. Afterwards, a new objective evaluation function of the interactive selection is developed. Then a novel feature selection algorithm named (NSUNCMI) based on measuring feature correlation, redundancy and interactivity is proposed. The results on the nine universe datasets and five representative feature selection algorithms indicate that NSUNCMI reduces the dimensionality of feature space efficiently and offers the best average classification accuracy.
引用
收藏
页码:345 / 359
页数:15
相关论文
共 40 条
  • [1] [Anonymous], 1994, MACHINE LEARNING
  • [2] Two hybrid wrapper-filter feature selection algorithms applied to high-dimensional microarray experiments
    Apolloni, Javier
    Leguizamon, Guillermo
    Alba, Enrique
    [J]. APPLIED SOFT COMPUTING, 2016, 38 : 922 - 932
  • [3] USING MUTUAL INFORMATION FOR SELECTING FEATURES IN SUPERVISED NEURAL-NET LEARNING
    BATTITI, R
    [J]. IEEE TRANSACTIONS ON NEURAL NETWORKS, 1994, 5 (04): : 537 - 550
  • [4] Feature selection using Joint Mutual Information Maximisation
    Bennasar, Mohamed
    Hicks, Yulia
    Setchi, Rossitza
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (22) : 8520 - 8532
  • [5] Feature Interaction Maximisation
    Bennasar, Mohamed
    Setchi, Rossitza
    Hicks, Yulia
    [J]. PATTERN RECOGNITION LETTERS, 2013, 34 (14) : 1630 - 1635
  • [6] Maximum relevance minimum common redundancy feature selection for nonlinear data
    Che, Jinxing
    Yang, Youlong
    Li, Li
    Bai, Xuying
    Zhang, Shenghu
    Deng, Chengzhi
    [J]. INFORMATION SCIENCES, 2017, 409 : 68 - 86
  • [7] Feature selection for imbalanced data based on neighborhood rough sets
    Chen, Hongmei
    Li, Tianrui
    Fan, Xin
    Luo, Chuan
    [J]. INFORMATION SCIENCES, 2019, 483 : 1 - 20
  • [8] Feature selection via normative fuzzy information weight with application into tumor classification
    Dai, Jianhua
    Chen, Jiaolong
    [J]. APPLIED SOFT COMPUTING, 2020, 92
  • [9] Consistency-based search in feature selection
    Dash, M
    Liu, HA
    [J]. ARTIFICIAL INTELLIGENCE, 2003, 151 (1-2) : 155 - 176
  • [10] Attribute reduction based on max-decision neighborhood rough set model
    Fan, Xiaodong
    Zhao, Weida
    Wang, Changzhong
    Huang, Yang
    [J]. KNOWLEDGE-BASED SYSTEMS, 2018, 151 : 16 - 23