The lattice and matroid representations of definable sets in generalized rough sets based on relations

2019 ◽  
Vol 485 ◽  
pp. 505-520 ◽  
Author(s):  
Zhaohao Wang ◽  
Qinrong Feng ◽  
Hong Wang
Keyword(s):  
Rough Sets ◽  
Definable Sets ◽  
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 On the Lattice of Intervals and Rough Sets

2009 ◽  
Vol 17 (4) ◽  
pp. 237-244 ◽  
Author(s):  
Adam Grabowski ◽  
Magdalena Jastrzębska
Keyword(s):  
Rough Set ◽  
Equivalence Relation ◽  
Rough Sets ◽  
Algebraic Theory ◽  
Algebraic Models ◽  
Lower Approximation ◽  
Definable Sets

On the Lattice of Intervals and Rough Sets Rough sets, developed by Pawlak [6], are an important tool to describe a situation of incomplete or partially unknown information. One of the algebraic models deals with the pair of the upper and the lower approximation. Although usually the tolerance or the equivalence relation is taken into account when considering a rough set, here we rather concentrate on the model with the pair of two definable sets, hence we are close to the notion of an interval set. In this article, the lattices of rough sets and intervals are formalized. This paper, being essentially the continuation of [3], is also a step towards the formalization of the algebraic theory of rough sets, as in [4] or [9].

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
Sign in / Sign up

Export Citation Format

Share Document