Extensions and intentions in the rough set theory
Information Sciences: an International Journal
Topological approaches to covering rough sets
Information Sciences: an International Journal
On Three Types of Covering-Based Rough Sets
IEEE Transactions on Knowledge and Data Engineering
Generalized rough sets over fuzzy lattices
Information Sciences: an International Journal
The algebraic structures of generalized rough set theory
Information Sciences: an International Journal
Rough operations on Boolean algebras
Information Sciences: an International Journal
On the structure of generalized rough sets
Information Sciences: an International Journal
Rough set theory for topological spaces
International Journal of Approximate Reasoning
Guest editorial: Advances in fuzzy sets and rough sets
International Journal of Approximate Reasoning
Algebraic approach to generalized rough sets
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
Fuzzy rough sets based on residuated lattices
Transactions on Rough Sets II
Information Sciences: an International Journal
On the generalization of fuzzy rough sets
IEEE Transactions on Fuzzy Systems
The Axiomatization of the Rough Set Upper Approximation Operations
Fundamenta Informaticae
Hi-index | 0.00 |
Rough set theory is an important technique in knowledge discovery in databases. Classical rough set theory proposed by Pawlak is based on equivalence relations, but many interesting and meaningful extensions have been made based on binary relations and coverings, respectively. This paper makes a comparison between covering rough sets and rough sets based on binary relations. This paper also focuses on the authors' study of the condition under which the covering rough set can be generated by a binary relation and the binary relation based rough set can be generated by a covering.