Granule-specific feature selection for continuous data classification using neighborhood rough sets

被引:2
|
作者
Sewwandi, Mahawaga Arachchige Nayomi Dulanjala [1 ]
Li, Yuefeng [1 ]
Zhang, Jinglan [1 ]
机构
[1] Queensland Univ Technol, Fac Sci, Sch Comp Sci, Brisbane, Qld 4000, Australia
基金
澳大利亚研究理事会;
关键词
Granules; Feature selection; Local features; Neighborhood rough set; Continuous data; Classification; LOCAL FEATURE-SELECTION;
D O I
10.1016/j.eswa.2023.121765
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Neighborhood rough set theories are commonly used in global feature selection to achieve high performance in continuous data classification. However, selecting a single feature subset to represent the entire dataset may degrade the performance when there are intra-class dissimilarities among objects. Therefore, this paper proposes a novel feature-selection method, Granule-specific Feature Selection (GFS) to select local feature subsets for continuous data classification. The feature selection approach constitutes a novel feature selection algorithm and a novel feature evaluation function and uses existing approaches for granule identification and classification with some adjustments. The neighborhood rough set theories are used in granule (subclass) identification within each class when there are no subclass label information available in the training data, while an improved k-Nearest Neighbors approach is used in classification with granule-specific feature subsets. Experimental results show GFS outperforms most of the global, class-specific, and local feature selection baselines in terms of classification performance.
引用
收藏
页数:11
相关论文
共 50 条
  • [31] A novel approach for feature selection using Rough Sets
    [J]. 1600, Institute of Electrical and Electronics Engineers Inc., United States
  • [32] A Novel Approach for Feature Selection using Rough Sets
    Yadav, Nidhika
    Chatterjee, Niladri
    [J]. 2017 INTERNATIONAL CONFERENCE ON COMPUTER, COMMUNICATIONS AND ELECTRONICS (COMPTELIX), 2017, : 195 - 199
  • [33] Online streaming feature selection using rough sets
    Eskandari, S.
    Javidi, M. M.
    [J]. INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2016, 69 : 35 - 57
  • [34] An improved runner-root algorithm for solving feature selection problems based on rough sets and neighborhood rough sets
    Ibrahim, Rehab Ali
    Abd Elaziz, Mohamed
    Oliva, Diego
    Lu, Songfeng
    [J]. APPLIED SOFT COMPUTING, 2020, 97
  • [35] A class-specific feature selection and classification approach using neighborhood rough set and K-nearest neighbor theories
    Sewwandi, M.A.N.D.
    Li, Yuefeng
    Zhang, Jinglan
    [J]. Applied Soft Computing, 2023, 143
  • [36] Multilabel Feature Selection Using Relief and Minimum Redundancy Maximum Relevance Based on Neighborhood Rough Sets
    Huang, Miaomiao
    Sun, Lin
    Xu, Jiucheng
    Zhang, Shiguang
    [J]. IEEE ACCESS, 2020, 8 : 62011 - 62031
  • [37] Efficient feature selection and classification algorithm based on PSO and rough sets
    Huda, Ramesh Kumar
    Banka, Haider
    [J]. NEURAL COMPUTING & APPLICATIONS, 2019, 31 (08): : 4287 - 4303
  • [38] Efficient feature selection and classification algorithm based on PSO and rough sets
    Ramesh Kumar Huda
    Haider Banka
    [J]. Neural Computing and Applications, 2019, 31 : 4287 - 4303
  • [39] Maximum relevance minimum redundancy-based feature selection using rough mutual information in adaptive neighborhood rough sets
    Kanglin Qu
    Jiucheng Xu
    Ziqin Han
    Shihui Xu
    [J]. Applied Intelligence, 2023, 53 : 17727 - 17746
  • [40] Maximum relevance minimum redundancy-based feature selection using rough mutual information in adaptive neighborhood rough sets
    Qu, Kanglin
    Xu, Jiucheng
    Han, Ziqin
    Xu, Shihui
    [J]. APPLIED INTELLIGENCE, 2023, 53 (14) : 17727 - 17746