Matrix-based set approximations and reductions in covering decision information systems
From MaRDI portal
Publication:2344725
Recommendations
- Matrix approaches for some issues about minimal and maximal descriptions in covering-based rough sets
- Novel matrix-based approaches to computing minimal and maximal descriptions in covering-based rough sets
- A new method of reduction in covering information systems
- Computing minimal description and maximal description in covering-based rough sets through matrices
- The investigation of covering rough sets by Boolean matrices
Cites work
- A comparative study of ordered and covering information systems
- A comparison of two kinds of definitions of rough approximations based on a similarity relation
- A comparison of two types of rough sets induced by coverings
- A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
- A novel method for attribute reduction of covering decision systems
- A rough set-based incremental approach for learning knowledge in dynamic incomplete information systems
- Approximations and reducts with covering generalized rough sets
- Composite rough sets for dynamic data mining
- Covering based rough set approximations
- Duality, conjugacy and adjointness of approximation operators in covering-based rough sets
- Evidence-theory-based numerical algorithms of attribute reduction with neighborhood-covering rough sets
- Extended results on the relationship between information systems
- Extensions and intensions in the rough set theory
- Generalized fuzzy rough approximation operators determined by fuzzy implicators
- scientific article; zbMATH DE number 3880694 (Why is no real title available?)
- scientific article; zbMATH DE number 927110 (Why is no real title available?)
- Multi-granulation rough sets based on tolerance relations
- Multigranulation decision-theoretic rough sets
- NMGRS: neighborhood-based multigranulation rough sets
- On multi-granulation covering rough sets
- On some types of neighborhood-related covering rough sets
- Probabilistic rough set approximations
- Reduction about approximation spaces of covering generalized rough sets
- Reduction and axiomization of covering generalized rough sets.
- Relational interpretations of neighborhood operators and rough set approximation operators
- Relationships between covering-based rough sets and relation-based rough sets
- Rough approximations on a complete completely distributive lattice with applications to generalized rough sets
- Rough sets
- Rough sets based matrix approaches with dynamic attribute variation in set-valued information systems
- Rough sets determined by tolerances
- Set-based granular computing: a lattice model
- The reduction and fusion of fuzzy covering systems based on the evidence theory
- Updating attribute reduction in incomplete decision systems with the variation of attribute set
- Variable-precision dominance-based rough set approach and attribute reduction
Cited in
(26)- Neighborhood operators for covering-based rough sets
- Feature selection using rough set-based direct dependency calculation by avoiding the positive region
- Matrix approaches for some issues about minimal and maximal descriptions in covering-based rough sets
- Knowledge reduction of dynamic covering decision information systems when varying covering cardinalities
- Matrix approach to spanning matroids of rough sets and its application to attribute reduction
- Maps between covering approximation spaces and the product space of two covering approximation spaces
- Generalized multi-scale decision tables with multi-scale decision attributes
- On characterizations of a pair of covering-based approximation operators
- Compound approximation spaces for relational data
- NEC: a nested equivalence class-based dependency calculation approach for fast feature selection using rough set theory
- Novel matrix-based approaches to computing minimal and maximal descriptions in covering-based rough sets
- Reductions of a covering approximation space from algebraic points of view
- Incremental approaches to computing approximations of sets in dynamic covering approximation spaces
- A Further Investigation to Relative Reducts of Decision Information Systems
- A new method of reduction in covering information systems
- scientific article; zbMATH DE number 6130163 (Why is no real title available?)
- A minimal family of sub-bases
- Computing minimal description and maximal description in covering-based rough sets through matrices
- An efficient feature selection algorithm based on the description vector and hypergraph
- Optimal scale selection and knowledge discovery in generalized multi-scale decision tables
- Grained matrix and complementary matrix: novel methods for computing information descriptions in covering approximation spaces
- Incremental updating reduction for relation decision systems with dynamic conditional relation sets
- Matrix-based local pessimistic multi-granulation incremental reduction in dynamic covering decision information systems
- Granular structures of covering-based rough set approximations through the Mapper algorithm
- Matrix-based local multigranulation reduction for covering decision information systems
- On some types of covering rough sets from topological points of view
This page was built for publication: Matrix-based set approximations and reductions in covering decision information systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2344725)
