Variable radius neighborhood rough sets and attribute reduction

被引:25
作者
Zhang, Di [1 ]
Zhu, Ping [1 ]
机构
[1] Beijing Univ Posts & Telecommun, Sch Sci, Beijing 100876, Peoples R China
基金
中国国家自然科学基金;
关键词
Neighborhood rough sets; Attribute reduction; Surrounding function; -covering; MULTI-LABEL CLASSIFICATION; FEATURE-SELECTION; ENTROPY; ALGORITHM; MODELS;
D O I
10.1016/j.ijar.2022.08.005
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Neighborhood rough sets provide important insights into dealing with numerical data. Neighborhood radius, a key factor that affects data uncertainty, is uniformly given in most of the existing neighborhood rough sets. Although it is concise and convenient to construct a granular structure, the same radius is not appropriate for the unique circumstance of each element in the universe. Therefore, taking the different environment of each object and label distribution into consideration, in this paper, we propose two novel neighborhood rough set models, namely, variable radius neighborhood rough sets (VRNRs) and neighborhood rough sets based on alpha-covering (alpha-CNRSs). They customize the neighborhood radius for each object or local region of the universe by surrounding functions. Based on an investigation of the basic properties of VRNRs and alpha-CNRSs, we present two attribute reduction algorithms. Moreover, three comparative experiments are designed in terms of the running time, model stability, and classification accuracy. Theoretical analyses and experimental results show that the two new neighborhood rough set models have good robustness and validity in attribute reduction and classification performance. (C) 2022 Elsevier Inc. All rights reserved.
引用
收藏
页码:98 / 121
页数:24
相关论文
共 67 条
[1]   Rough sets and topological spaces based on similarity [J].
Abo-Tabl, E. A. .
INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2013, 4 (05) :451-458
[2]   A novel technique to detect a suboptimal threshold of neighborhood rough sets for hyperspectral band selection [J].
Barman, Barnali ;
Patra, Swarnajyoti .
SOFT COMPUTING, 2019, 23 (24) :13709-13719
[3]   Extensions and intentions in the rough set theory [J].
Bonikowski, Z ;
Bryniarski, E ;
Wybraniec-Skardowska, U .
INFORMATION SCIENCES, 1998, 107 (1-4) :149-167
[4]   Object similarity measures and Pawlak's indiscernibility on decision tables [J].
Catanzariti, Francesca ;
Chiaselotti, Giampiero ;
Infusino, Federico G. ;
Marino, Giuseppe .
INFORMATION SCIENCES, 2020, 539 :104-135
[5]   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
[6]   Feature selection for imbalanced data based on neighborhood rough sets [J].
Chen, Hongmei ;
Li, Tianrui ;
Fan, Xin ;
Luo, Chuan .
INFORMATION SCIENCES, 2019, 483 :1-20
[7]   Extending characteristic relations on an incomplete data set by the three-way decision theory [J].
Chen, Yingxiao ;
Zhu, Ping .
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2020, 119 :108-121
[8]   Granule structures, distances and measures in neighborhood systems [J].
Chen, Yumin ;
Qin, Nan ;
Li, Wei ;
Xu, Feifei .
KNOWLEDGE-BASED SYSTEMS, 2019, 165 :268-281
[9]   Neighborhood rough set reduction with fish swarm algorithm [J].
Chen, Yumin ;
Zeng, Zhiqiang ;
Lu, Junwen .
SOFT COMPUTING, 2017, 21 (23) :6907-6918
[10]   Measures of uncertainty for neighborhood rough sets [J].
Chen, Yumin ;
Xue, Yu ;
Ma, Ying ;
Xu, Feifei .
KNOWLEDGE-BASED SYSTEMS, 2017, 120 :226-235