On a Representation of Rough Sets by Means of Information Systems

1983 ◽  
Vol 6 (3-4) ◽  
pp. 289-296
Author(s):  
Miroslav Novotný ◽  
Zdzisław Pawlak
Keyword(s):  
Information Systems ◽  
Rough Sets ◽  
Representation Theorems

Rought sets are investigated as a tool for expressing uncertainty of the relation “to be an element of”. We give some representation theorems for rough sets expressed in terms of information systems.

Representation Theorems for Terms in a Certain Model for Information Systems

1982 ◽  
Vol 5 (1) ◽  
pp. 1-14
Author(s):  
Bernd Reusch ◽  
Gerd Szwillus
Keyword(s):  
Information Systems ◽  
Normal Forms ◽  
Abstract Model ◽  
Representation Theorems

We study a term-language, which is used by the “Warsaw-School” in an abstract model for information systems. Various normal forms as well as standard expansions with respect to product terms are formulated and proved correct. It is shown that the shortest sums of so-called maximal sub-products are the shortest representations of terms and algorithms for their generation are given.

α-Dominance relation and rough sets in interval-valued information systems

2015 ◽  
Vol 294 ◽  
pp. 334-347 ◽  
Author(s):  
Xibei Yang ◽  
Yong Qi ◽  
Dong-Jun Yu ◽  
Hualong Yu ◽  
Jingyu Yang
Keyword(s):  
Information Systems ◽  
Rough Sets ◽  
Dominance Relation ◽  
Interval Valued

Soft dominance based rough sets with applications in information systems

2019 ◽  
Vol 113 ◽  
pp. 171-195 ◽  
Author(s):  
Abbas Ali ◽  
Muhammad Irfan Ali ◽  
Noor Rehman
Keyword(s):  
Information Systems ◽  
Rough Sets

Soft Computing for Evolutionary Information Systems — Potentials of Rough Sets

2000 ◽  
pp. 481-494 ◽  
Author(s):  
A. B. Patki ◽  
G. V. Raghunathan ◽  
Soumik Ghosh ◽  
S. Sivasubramanian ◽  
Azar Khurshid
Keyword(s):  
Information Systems ◽  
Soft Computing ◽  
Rough Sets ◽  
Evolutionary Information

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.

Communication Between Information Systems Using Fuzzy Rough Sets

2013 ◽  
Vol 21 (3) ◽  
pp. 527-540 ◽  
Author(s):  
E. C. C. Tsang ◽  
Changzhong Wang ◽  
Degang Chen ◽  
Congxin Wu ◽  
Qinghua Hu
Keyword(s):  
Information Systems ◽  
Rough Sets ◽  
Fuzzy Rough Sets
Sign in / Sign up

Export Citation Format

Share Document