Algebraic Properties of Generalized Rough Sets

2009 ◽  
Vol 94 (1) ◽  
pp. 41-48
Author(s):  
Michiro Kondo
Keyword(s):  
Rough Sets ◽  
Algebraic Properties ◽  
Generalized Rough Sets

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
Keyword(s):  
Rough Sets ◽  
Neighborhood System ◽  
Generalized Rough Sets

Generalized rough sets based feature selection

2000 ◽  
Vol 4 (1) ◽  
pp. 3-17 ◽  
Author(s):  
Mohamed Quafafou ◽  
Moussa Boussouf
Keyword(s):  
Feature Selection ◽  
Rough Sets ◽  
Generalized Rough Sets

scholarly journals Reduction of Neighborhood-Based Generalized Rough Sets

2011 ◽  
Vol 2011 ◽  
pp. 1-22 ◽  
Author(s):  
Zhaohao Wang ◽  
Lan Shu ◽  
Xiuyong Ding
Keyword(s):  
Information Systems ◽  
Set Theory ◽  
Rough Set ◽  
Rough Sets ◽  
Rough Set Theory ◽  
Open Problems ◽  
The Third ◽  
Generalized Rough Sets

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.

On the structure of generalized rough sets

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

Generalized rough sets over fuzzy lattices

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

Neighborhood Systems and Variable Precision Generalized Rough Sets*

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

scholarly journals Approximations and reducts with covering generalized rough sets

2008 ◽  
Vol 56 (1) ◽  
pp. 279-289 ◽  
Author(s):  
Eric C.C. Tsang ◽  
Chen Degang ◽  
Daniel S. Yeung
Keyword(s):  
Rough Sets ◽  
Generalized Rough Sets

Model of Covering Rough Sets in the Machine Intelligence

2012 ◽  
Vol 548 ◽  
pp. 735-739
Author(s):  
Hong Mei Nie ◽  
Jia Qing Zhou
Keyword(s):  
Information Systems ◽  
Set Theory ◽  
Rough Set ◽  
Equivalence Relation ◽  
Rough Sets ◽  
Rough Set Theory ◽  
Machine Intelligence ◽  
Upper Approximation ◽  
Generalized Rough Sets

Rough set theory has been proposed by Pawlak as a useful tool for dealing with the vagueness and granularity in information systems. Classical rough set theory is based on equivalence relation. The covering rough sets are an improvement of Pawlak rough set to deal with complex practical problems which the latter one can not handle. This paper studies covering-based generalized rough sets. In this setting, we investigate common properties of classical lower and upper approximation operations hold for the covering-based lower and upper approximation operations and relationships among some type of covering rough sets.

Sign in / Sign up

Export Citation Format

Share Document