Data volume reduction in covering approximation spaces with respect to twenty-two types of covering based rough sets
From MaRDI portal
Publication:289003
DOI10.1016/J.IJAR.2016.04.002zbMATH Open1356.68238OpenAlexW2339706189MaRDI QIDQ289003FDOQ289003
Authors: A. Shakiba, M. R. Hooshmandasl 
Publication date: 27 May 2016
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2016.04.002
Recommendations
- Homomorphisms between covering approximation spaces
- Data compression with homomorphism in covering information systems
- On invariance properties of a type of covering upper approximation operator under consistent function
- Reduction and axiomization of covering generalized rough sets.
- Covering-Based Generalized Rough Fuzzy Sets
Cites Work
- Rough sets
- Fuzzy sets
- Title not available (Why is that?)
- Extensions and intensions in the rough set theory
- Reduction and axiomization of covering generalized rough sets.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some properties of relation information systems under homomorphisms
- Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic
- Relational interpretations of neighborhood operators and rough set approximation operators
- Rough set approach to incomplete information systems
- A systematic study on attribute reduction with rough sets based on general binary relations
- Data compression with homomorphism in covering information systems
- Invariant characters of information systems under some homomorphisms
- Homomorphisms between fuzzy information systems
- Communicating between information systems
- Some improved results on communication between information systems
- Neighborhood operators for covering-based rough sets
- Communication between information systems with covering based rough sets
- Rough mereology: A new paradigm for approximate reasoning
- \(S\)-approximation: a new approach to algebraic approximation
- 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
- On multi-granulation covering rough sets
- S-approximation spaces: a three-way decision approach
- Title not available (Why is that?)
- Communicating between information systems based on including degrees
- Title not available (Why is that?)
- Rough Set Models on Two universes
- Connections between covering-based rough sets and concept lattices
- Partial order relation for approximation operators in covering based rough sets
- Homomorphisms between fuzzy information systems revisited
- Rough set theory applied to (fuzzy) ideal theory
- Covering based rough set approximations
- The fourth type of covering-based rough sets
- 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
Cited In (5)
- Matrix approaches for some issues about minimal and maximal descriptions in covering-based rough sets
- Fuzzy \(\beta \)-covering approximation spaces
- Data compression with homomorphism in covering information systems
- Homomorphisms between covering approximation spaces
- On invariance properties of a type of covering upper approximation operator under consistent function
Uses Software
This page was built for publication: Data volume reduction in covering approximation spaces with respect to twenty-two types of covering based rough sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q289003)
