Subset neighborhood rough sets

2021 ◽  
pp. 107868
Author(s):  
Tareq M. Al-shami ◽  
Davide Ciucci
2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Jie Yang ◽  
Tian Luo ◽  
Fan Zhao ◽  
Shuai Li ◽  
Wei Zhou

Information granule is the basic element in granular computing (GrC), and it can be obtained according to the granulation criterion. In neighborhood rough sets, current uncertainty measures focus on computing the knowledge granulation of single granular space and have two main limitations: (i) neglecting the structural information of boundary regions and (ii) the inability to reflect the difference between neighborhood granular spaces with the same uncertainty for approximating a target concept. Firstly, a fuzziness-based uncertainty measure for neighborhood rough sets is introduced to characterize the structural information of boundary regions. Moreover, from the perspective of distance, based on the idea of density peaks, we present a fuzzy-neighborhood-granule-distance- (FNGD-) based method to discover the relationship between granules in a granular space. Then, to characterize the difference between granular spaces for approximating a target concept, we present the fuzzy neighborhood granular space distance (FNGSD) and fuzzy neighborhood boundary region distance (FNBRD). FNGD, FNGSD, and FNBRD are hierarchically organized from fineness to coarseness according to the semantics of granularity, which provide three-layer perspectives in the neighborhood system.


2021 ◽  
pp. 1-11
Author(s):  
Jie Yang ◽  
Tian Luo ◽  
Lijuan Zeng ◽  
Xin Jin

Neighborhood rough sets (NRS) are the extended model of the classical rough sets. The NRS describe the target concept by upper and lower neighborhood approximation boundaries. However, the method of approximately describing the uncertain target concept with existed neighborhood information granules is not given. To solve this problem, the cost-sensitive approximation model of the NRS is proposed in this paper, and its related properties are analyzed. To obtain the optimal approximation granular layer, the cost-sensitive progressive mechanism is proposed by considering user requirements. The case study shows that the reasonable granular layer and its approximation can be obtained under certain constraints, which is suitable for cost-sensitive application scenarios. The experimental results show that the advantage of the proposed approximation model, moreover, the decision cost of the NRS approximation model will monotonically decrease with granularity being finer.


Entropy ◽  
2019 ◽  
Vol 21 (2) ◽  
pp. 138 ◽  
Author(s):  
Lin Sun ◽  
Lanying Wang ◽  
Jiucheng Xu ◽  
Shiguang Zhang

For continuous numerical data sets, neighborhood rough sets-based attribute reduction is an important step for improving classification performance. However, most of the traditional reduction algorithms can only handle finite sets, and yield low accuracy and high cardinality. In this paper, a novel attribute reduction method using Lebesgue and entropy measures in neighborhood rough sets is proposed, which has the ability of dealing with continuous numerical data whilst maintaining the original classification information. First, Fisher score method is employed to eliminate irrelevant attributes to significantly reduce computation complexity for high-dimensional data sets. Then, Lebesgue measure is introduced into neighborhood rough sets to investigate uncertainty measure. In order to analyze the uncertainty and noisy of neighborhood decision systems well, based on Lebesgue and entropy measures, some neighborhood entropy-based uncertainty measures are presented, and by combining algebra view with information view in neighborhood rough sets, a neighborhood roughness joint entropy is developed in neighborhood decision systems. Moreover, some of their properties are derived and the relationships are established, which help to understand the essence of knowledge and the uncertainty of neighborhood decision systems. Finally, a heuristic attribute reduction algorithm is designed to improve the classification performance of large-scale complex data. The experimental results under an instance and several public data sets show that the proposed method is very effective for selecting the most relevant attributes with high classification accuracy.


2020 ◽  
Vol 7 (5) ◽  
pp. 1123-1130
Author(s):  
Abdel-Fattah Attia ◽  
Mohamed Abd Elaziz ◽  
Aboul Ella Hassanien ◽  
Ragab A. El-Sehiemy

Sign in / Sign up

Export Citation Format

Share Document