Matrix approaches for some issues about minimal and maximal descriptions in covering-based rough sets
From MaRDI portal
Publication:1726324
Recommendations
- Novel matrix-based approaches to computing minimal and maximal descriptions in covering-based rough sets
- Computing minimal description and maximal description in covering-based rough sets through matrices
- Matrix-based set approximations and reductions in covering decision information systems
- The investigation of covering rough sets by Boolean matrices
- A new method of reduction in covering information systems
Cites work
- A comprehensive study of fuzzy covering-based rough set models: definitions, properties and interrelationships
- A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
- A semantically sound approach to Pawlak rough sets and covering-based rough sets
- An axiomatic approach to the roughness measure of rough sets
- Applications of Bipartite Graphs and their Adjacency Matrices to Covering-based Rough Sets
- Applications of matrices to a matroidal structure of rough sets
- Approaches to knowledge reduction of covering decision systems based on information theory
- Attribute reduction based on evidence theory in incomplete decision systems
- Attribute reduction in decision-theoretic rough set models
- Characteristic matrix of covering and its application to Boolean matrix decomposition
- Communication between information systems with covering based rough sets
- Computing minimal description and maximal description in covering-based rough sets through matrices
- Connections between covering-based rough sets and concept lattices
- Covering based rough set approximations
- Covering-Based Generalized Rough Fuzzy Sets
- Covering-based rough sets and modal logics. I.
- Covering-based rough sets and modal logics. II.
- Data compression with homomorphism in covering information systems
- Data volume reduction in covering approximation spaces with respect to twenty-two types of covering based rough sets
- Extensions and intensions in the rough set theory
- Four operators of rough sets generalized to matroids and a matroidal method for attribute reduction
- Fuzzy anti-grouped filters and fuzzy normal filters in pseudo-BCI algebras
- scientific article; zbMATH DE number 5129599 (Why is no real title available?)
- scientific article; zbMATH DE number 4046636 (Why is no real title available?)
- Matrix representations and interdependency on L-fuzzy covering-based approximation operators
- Matrix-based set approximations and reductions in covering decision information systems
- Minimal description and maximal description in covering-based rough sets
- Notes on covering-based rough sets from topological point of view: relationships with general framework of dual approximation operators
- On axiomatic characterizations of three pairs of covering based approximation operators
- On some types of fuzzy covering-based rough sets
- On the coverings by tolerance classes
- On the union and intersection operations of rough sets based on various approximation spaces
- Positive approximation: an accelerator for attribute reduction in rough set theory
- Reduction about approximation spaces of covering generalized rough sets
- Reduction and axiomization of covering generalized rough sets.
- Related family: a new method for attribute reduction of covering information systems
- Relations of reduction between covering generalized rough sets and concept lattices
- Relationship among basic concepts in covering-based rough sets
- Rough set theory applied to (fuzzy) ideal theory
- Rough sets
- Rough sets and matroids from a lattice-theoretic viewpoint
- Rough sets: some extensions
- The investigation of covering rough sets by Boolean matrices
- The relationship among different covering approximations
- Topological approaches to covering rough sets
- Two fuzzy covering rough set models and their generalizations over fuzzy lattices
Cited in
(13)- The investigation of covering rough sets by Boolean matrices
- Fuzzy \(\beta \)-covering approximation spaces
- Maps between covering approximation spaces and the product space of two covering approximation spaces
- Matrix-based set approximations and reductions in covering decision information systems
- Novel matrix-based approaches to computing minimal and maximal descriptions in covering-based rough sets
- A new method of reduction in covering information systems
- A minimal family of sub-bases
- Computing minimal description and maximal description in covering-based rough sets through matrices
- The minimal description of formal concept analysis
- A novel notion in rough set theory: invariant subspace
- Matrix approach for fuzzy description reduction and group decision-making with fuzzy \(\beta\)-covering
- Grained matrix and complementary matrix: novel methods for computing information descriptions in covering approximation spaces
- Matrix representation of the conditional entropy for incremental feature selection on multi-source data
This page was built for publication: Matrix approaches for some issues about minimal and maximal descriptions in covering-based rough sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1726324)
