On Three Types of Covering-Based Rough Sets
IEEE Transactions on Knowledge and Data Engineering
Relationship between generalized rough sets based on binary relation and covering
Information Sciences: an International Journal
Relationship among basic concepts in covering-based rough sets
Information Sciences: an International Journal
Covering based approximation – a new type approach
International Journal of Computational Vision and Robotics
Generalized rough sets and implication lattices
Transactions on rough sets XIV
Covering based rough set approximations
Information Sciences: an International Journal
The fourth type of covering-based rough sets
Information Sciences: an International Journal
Relationships among generalized rough sets in six coverings and pure reflexive neighborhood system
Information Sciences: an International Journal
Duality, conjugacy and adjointness of approximation operators in covering-based rough sets
International Journal of Approximate Reasoning
Hi-index | 0.00 |
Rough set theory has been proposed by Pawlak as a tool for dealing with the vagueness and granularity in information systems. The core concepts of classical rough sets are lower and upper approximations based on equivalence relations, or partitions. This paper studies covering-based generalized rough sets. In this setting, a covering can also generate a lower approximation operation and an upper approximation operation, but some of common properties of classical lower and upper approximation operations are no longer satisfied. We investigate conditions for a covering under which these properties hold for the covering-based lower and upper approximation operations.