Data compression with homomorphism in covering information systems
DOI10.1016/J.IJAR.2010.11.009zbMATH Open1217.68240OpenAlexW1966564418MaRDI QIDQ553986FDOQ553986
Authors: Changzhong Wang, Qinhua Hu, Chong Wu, Degang Chen 
Publication date: 29 July 2011
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2010.11.009
Recommendations
- Homomorphisms between covering approximation spaces
- Homomorphisms-based attribute reduction of dynamic fuzzy covering information systems
- Invariant characterizations of fuzzy information systems under some homomorphisms based on data compression and related results
- Data volume reduction in covering approximation spaces with respect to twenty-two types of covering based rough sets
- Compression of dynamic fuzzy relation information systems
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)
Cites Work
- Reduction and axiomization of covering generalized rough sets.
- Title not available (Why is that?)
- Generalized fuzzy rough sets
- Selecting informative features with fuzzy-rough sets and its application for complex systems monitoring
- Axiomatics for fuzzy rough sets
- ROUGH FUZZY SETS AND FUZZY ROUGH SETS*
- Some properties of relation information systems under homomorphisms
- Learning fuzzy rules from fuzzy samples based on rough set technique
- A systematic study on attribute reduction with rough sets based on general binary relations
- Rough set methods in feature selection and recognition
- Title not available (Why is that?)
- On rough sets and information system homomorphisms
- Invariant characters of information systems under some homomorphisms
- Homomorphisms between fuzzy information systems
- A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
- Title not available (Why is that?)
- Rough set theory applied to (fuzzy) ideal theory
- A comparison of two types of rough sets induced by coverings
- Reduction about approximation spaces of covering generalized rough sets
- Dependence-space-based attribute reductions in inconsistent decision information systems
- Variable-precision dominance-based rough set approach and attribute reduction
Cited In (23)
- Invariant characterizations of fuzzy relation information systems under homomorphisms
- Matrix approaches for some issues about minimal and maximal descriptions in covering-based rough sets
- Covering-based soft fuzzy rough theory and its application to multiple criteria decision making
- Fuzzy information systems and their homomorphisms
- The reduction and fusion of fuzzy covering systems based on the evidence theory
- Information structures in a covering information system
- A fuzzy covering-based rough set model and its generalization over fuzzy lattice
- Data volume reduction in covering approximation spaces with respect to twenty-two types of covering based rough sets
- Homomorphisms between covering approximation spaces
- Homomorphisms-based attribute reduction of dynamic fuzzy covering information systems
- Homomorphisms between fuzzy information systems revisited
- Entropy and co-entropy of a covering approximation space
- On some types of neighborhood-related covering rough sets
- On some types of fuzzy covering-based rough sets
- Invariant characterizations of fuzzy information systems under some homomorphisms based on data compression and related results
- Communication between information systems with covering based rough sets
- On invariance properties of a type of covering upper approximation operator under consistent function
- Equivalent characterizations of some graph problems by covering-based rough sets
- On consistent functions for neighborhood systems
- Extended results on the relationship between information systems
- A unified view of consistent functions
- A minimal family of sub-bases
- Four matroidal structures of covering and their relationships with rough sets
This page was built for publication: Data compression with homomorphism in covering information systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q553986)
