NEC: A nested equivalence class-based dependency calculation approach for fast feature selection using rough set theory

被引:13
作者
Zhao, Jie [1 ,2 ]
Liang, Jia-Ming [1 ]
Dong, Zhen-Ning [1 ]
Tang, De-Yu [3 ]
Liu, Zhen [3 ]
机构
[1] Guangdong Univ Technol, Sch Management, Guangzhou 510006, Peoples R China
[2] Cornell Univ, Sch Elect & Comp Engn, New York, NY 14850 USA
[3] Guangdong Pharmaceut Univ, Sch Med Informat & Engn, Guangzhou 510006, Peoples R China
基金
中国国家自然科学基金;
关键词
Feature selection; Rough set theory; Attribute reduction; Positive region; Heuristic algorithm; Swarm intelligence; ATTRIBUTE REDUCTION; DECISION SYSTEMS; OPTIMIZATION; ALGORITHM; CLASSIFICATION; APPROXIMATION; TABLES; PSO;
D O I
10.1016/j.ins.2020.03.092
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Feature selection plays an important role in data mining and machine learning tasks. As one of the most effective methods for feature selection, rough set theory provides a systematic theoretical framework for consistency-based feature selection, in which positive region-based dependency calculation is the most important step. However, it is time-consuming, and although many improved algorithms have been proposed, they are still computationally time-consuming. Therefore, to overcome this shortcoming, in this study, a nested equivalence class (NEC) approach is introduced to calculate dependency. The proposed method starts from the finest partition of the universe, and then extracts and uses the known knowledge of reducts in a decision table to construct an NEC. The proposed method not only simplifies dependency calculation but also reduces the universe correspondingly, in most cases. Using the proposed NEC-based approach, a number of representative heuristic- and swarm intelligence-based feature selection algorithms that apply rough set theory were enhanced. Note that the feature subset selected by each modified algorithm and that selected by the original algorithm were the same. Experiments conducted using 33 datasets from the UCI repository and KDD Cup competition, which included large-scale and high-dimensional datasets, demonstrated the efficiency and effectiveness of the proposed method. (C) 2020 Elsevier Inc. All rights reserved.
引用
收藏
页码:431 / 453
页数:23
相关论文
共 49 条
[1]   Unsupervised text feature selection technique based on hybrid particle swarm optimization algorithm with genetic operators for the text clustering [J].
Abualigah, Laith Mohammad ;
Khader, Ahamad Tajudin .
JOURNAL OF SUPERCOMPUTING, 2017, 73 (11) :4773-4795
[2]  
[Anonymous], 2008, Computational Intelligence and Feature Selection: Rough and Fuzzy Approaches
[3]   Two hybrid wrapper-filter feature selection algorithms applied to high-dimensional microarray experiments [J].
Apolloni, Javier ;
Leguizamon, Guillermo ;
Alba, Enrique .
APPLIED SOFT COMPUTING, 2016, 38 :922-932
[4]   A Hamming distance based binary particle swarm optimization (HDBPSO) algorithm for high dimensional feature selection, classification and validation [J].
Banka, Haider ;
Dara, Suresh .
PATTERN RECOGNITION LETTERS, 2015, 52 :94-100
[5]  
Bellman R., 1961, Adaptive Control Processes: a Guided Tour, DOI [DOI 10.1515/9781400874668, 10.1515/9781400874668]
[6]   A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets [J].
Chen Degang ;
Wang Changzhong ;
Hu Qinghua .
INFORMATION SCIENCES, 2007, 177 (17) :3500-3518
[7]   Finding rough set reducts with fish swarm algorithm [J].
Chen, Yumin ;
Zhu, Qingxin ;
Xu, Huarong .
KNOWLEDGE-BASED SYSTEMS, 2015, 81 :22-29
[8]   An artificial bee colony algorithm with a Modified Choice Function for the traveling salesman problem [J].
Choong, Shin Siang ;
Wong, Li-Pei ;
Lim, Chee Peng .
SWARM AND EVOLUTIONARY COMPUTATION, 2019, 44 :622-635
[9]   A group incremental feature selection for classification using rough set theory based genetic algorithm [J].
Das, Asit K. ;
Sengupta, Shampa ;
Bhattacharyya, Siddhartha .
APPLIED SOFT COMPUTING, 2018, 65 :400-411
[10]   Consistency-based search in feature selection [J].
Dash, M ;
Liu, HA .
ARTIFICIAL INTELLIGENCE, 2003, 151 (1-2) :155-176