A Comparison of Two Types of Covering-Based Rough Sets Through the Complement of Coverings
From MaRDI portal
Publication:3300259
DOI10.1007/978-3-319-25783-9_9zbMath1444.68233OpenAlexW2404995648MaRDI QIDQ3300259
Publication date: 28 July 2020
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-25783-9_9
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On some types of neighborhood-related covering rough sets
- Partial order relation for approximation operators in covering based rough sets
- Covering based rough set approximations
- Topological characterizations of covering for special covering-based upper approximation operators
- Approaches to knowledge reduction of covering decision systems based on information theory
- Topological approaches to covering rough sets
- A comparison of two types of rough sets induced by coverings
- Relationship between generalized rough sets based on binary relation and covering
- Reduction and axiomization of covering generalized rough sets.
- Relational interpretations of neighborhood operators and rough set approximation operators
- Duality, conjugacy and adjointness of approximation operators in covering-based rough sets
- A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
- A fast approach to attribute reduction in incomplete decision systems with tolerance relation-based rough sets
- Measuring roughness of generalized rough sets induced by a covering
- On the structure of generalized rough sets
- Dialectics of Counting and the Mathematics of Vagueness
- Rough sets
- Transactions on Rough Sets I
