Novel matrix-based approaches to computing minimal and maximal descriptions in covering-based rough sets
From MaRDI portal
Publication:2666871
Recommendations
- Matrix approaches for some issues about 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
- Minimal description and maximal description in covering-based rough sets
- The investigation of covering rough sets by Boolean matrices
Cites work
- A comparison of two types of rough sets induced by coverings
- A semantically sound approach to Pawlak rough sets and covering-based rough sets
- Applications of Bipartite Graphs and their Adjacency Matrices to Covering-based Rough Sets
- Artificial Intelligence and Soft Computing - ICAISC 2004
- Characteristic matrix of covering and its application to Boolean matrix decomposition
- Computing minimal description and maximal description in covering-based rough sets through matrices
- Covering based rough set approximations
- Covering rough sets based on neighborhoods: an approach without using neighborhoods
- Duality, conjugacy and adjointness of approximation operators in covering-based rough sets
- Entropy and co-entropy of a covering approximation space
- Extensions and intensions in the rough set theory
- Foundations and novel approaches in data mining
- Generalized rough sets based on relations
- scientific article; zbMATH DE number 3880694 (Why is no real title available?)
- scientific article; zbMATH DE number 5129599 (Why is no real title available?)
- scientific article; zbMATH DE number 4046636 (Why is no real title available?)
- Information granulation and rough set approximation
- Matrix approaches for some issues about minimal and maximal descriptions in covering-based rough sets
- Matrix representations and interdependency on L-fuzzy covering-based approximation operators
- Matrix-based set approximations and reductions in covering decision information systems
- On some types of neighborhood-related covering rough sets
- On the coverings by tolerance classes
- On the union and intersection operations of rough sets based on various approximation spaces
- Partial order relation for approximation operators in covering based rough sets
- Reduction and axiomization of covering generalized rough sets.
- Relational interpretations of neighborhood operators and rough set approximation operators
- Relationship among basic concepts in covering-based rough sets
- Relationship between generalized rough sets based on binary relation and covering
- Relationships between covering-based rough sets and relation-based rough sets
- Rough set theory applied to (fuzzy) ideal theory
- Rough sets
- Three approaches to missing attribute values: a rough set perspective
- Transactions on Rough Sets I
Cited in
(13)- Matrix approaches for some issues about minimal and maximal descriptions in covering-based rough sets
- The investigation of covering rough sets by Boolean matrices
- Three-way decision with co-training for partially labeled data
- Matrix-based set approximations and reductions in covering decision information systems
- Minimal description and maximal description in covering-based rough sets
- 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
- Redefined fuzzy rough set models in fuzzy -covering group approximation spaces
- 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
- Novel fuzzy \(\beta\)-covering rough set models and their applications
- On four novel kinds of fuzzy -covering-based rough sets and their applications to three-way approximations
This page was built for publication: Novel matrix-based approaches to computing 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 Q2666871)