Relationships among generalized rough sets in six coverings and pure reflexive neighborhood system

2012 ◽  
Vol 207 ◽  
pp. 66-78 ◽  
Author(s):  
Lijuan Wang ◽  
Xibei Yang ◽  
Jingyu Yang ◽  
Chen Wu
2015 ◽  
Vol 319 ◽  
pp. 56-67 ◽  
Author(s):  
Yan-Lan Zhang ◽  
Chang-Qing Li ◽  
Meng-Lei Lin ◽  
Yao-Jin Lin

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.


2000 ◽  
Vol 4 (1) ◽  
pp. 3-17 ◽  
Author(s):  
Mohamed Quafafou ◽  
Moussa Boussouf

2011 ◽  
Vol 2011 ◽  
pp. 1-22 ◽  
Author(s):  
Zhaohao Wang ◽  
Lan Shu ◽  
Xiuyong Ding

Rough set theory is a powerful tool for dealing with uncertainty, granularity, and incompleteness of knowledge in information systems. This paper discusses five types of existing neighborhood-based generalized rough sets. The concepts of minimal neighborhood description and maximal neighborhood description of an element are defined, and by means of the two concepts, the properties and structures of the third and the fourth types of neighborhood-based rough sets are deeply explored. Furthermore, we systematically study the covering reduction of the third and the fourth types of neighborhood-based rough sets in terms of the two concepts. Finally, two open problems proposed by Yun et al. (2011) are solved.


2006 ◽  
Vol 176 (5) ◽  
pp. 589-600 ◽  
Author(s):  
Michiro Kondo

2008 ◽  
Vol 178 (6) ◽  
pp. 1651-1662 ◽  
Author(s):  
Guilong Liu

2017 ◽  
Vol 153 (3) ◽  
pp. 271-290 ◽  
Author(s):  
Yu-Ru Syau ◽  
En-Bing Lin ◽  
Churn-Jung Liau

Sign in / Sign up

Export Citation Format

Share Document