Entropy and co-entropy of a covering approximation space
From MaRDI portal
Publication:448938
DOI10.1016/J.IJAR.2011.12.004zbMATH Open1246.68237OpenAlexW2020614133MaRDI QIDQ448938FDOQ448938
Publication date: 11 September 2012
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2011.12.004
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Mathematical Theory of Communication
- Rough sets
- Extensions and intensions in the rough set theory
- Reduction and axiomization of covering generalized rough sets.
- Uncertainty measures of rough set prediction
- Two views of the theory of rough sets in finite universes
- Generalized fuzzy rough approximation operators based on fuzzy coverings
- Measuring roughness of generalized rough sets induced by a covering
- An Axiomatic Approach to the Roughness Measure of Rough Sets
- THE INFORMATION ENTROPY, ROUGH ENTROPY AND KNOWLEDGE GRANULATION IN ROUGH SET THEORY
- MEASURING UNCERTAINTY IN ROUGH SET THEORY
- Data compression with homomorphism in covering information systems
- Information granules and entropy theory in information systems
- Topological approaches to covering rough sets
- Reduction about approximation spaces of covering generalized rough sets
- Rough approximations of vague sets in fuzzy approximation space
- Relationship among basic concepts in covering-based rough sets
- Topology vs generalized rough sets
- Information entropy, rough entropy and knowledge granulation in incomplete information systems
- Information Entropy and Granulation Co–Entropy of Partitions and Coverings: A Summary
- A new measure of uncertainty based on knowledge granulation for rough sets
- Covering rough sets based on neighborhoods: an approach without using neighborhoods
- Knowledge structure, knowledge granulation and knowledge distance in a knowledge base
- An improved accuracy measure for rough sets
- Hybrid approaches to attribute reduction based on indiscernibility and discernibility relation
Cited In (19)
- On some types of covering rough sets from topological points of view
- Evidence-theory-based numerical algorithms of attribute reduction with neighborhood-covering rough sets
- The investigation of covering rough sets by Boolean matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Three-way decisions based on covering rough set
- Information structures in a covering information system
- Partial order relation for approximation operators in covering based rough sets
- Covering based rough set approximations
- On some types of neighborhood-related covering rough sets
- Information-theoretic measures associated with rough set approximations
- Covering-based multi-granulation fuzzy rough sets
- On measurements of covering rough sets based on granules and evidence theory
- Novel matrix-based approaches to computing minimal and maximal descriptions in covering-based rough sets
- Duality, conjugacy and adjointness of approximation operators in covering-based rough sets
- Covering-based multigranulation decision-theoretic rough sets
- On multi-granulation covering rough sets
- Six-set approximation theorem of neighborhood related rough sets
- Entropy and set covering
This page was built for publication: Entropy and co-entropy of a covering approximation space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q448938)
