Matrix-based set approximations and reductions in covering decision information systems
From MaRDI portal
Publication:2344725
DOI10.1016/j.ijar.2015.01.006zbMath1328.68230MaRDI QIDQ2344725
Guoping Lin, Anhui Tan, Yao-Jin Lin, Jin Jin Li
Publication date: 18 May 2015
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2015.01.006
minimal description; matrix; rough set; reduct; set approximation; covering decision information system
68T37: Reasoning under uncertainty in the context of artificial intelligence
Related Items
A Minimal Family of Sub-bases, 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, Compound approximation spaces for relational data, On some types of covering rough sets from topological points of view, 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, 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, A Further Investigation to Relative Reducts of Decision Information Systems
Cites Work
- Unnamed Item
- Unnamed Item
- The reduction and fusion of fuzzy covering systems based on the evidence theory
- Rough sets based matrix approaches with dynamic attribute variation in set-valued information systems
- On some types of neighborhood-related covering rough sets
- A rough set-based incremental approach for learning knowledge in dynamic incomplete information systems
- A novel method for attribute reduction of covering decision systems
- Composite rough sets for dynamic data mining
- Extended results on the relationship between information systems
- A comparison of two kinds of definitions of rough approximations based on a similarity relation
- Covering based rough set approximations
- Multi-granulation rough sets based on tolerance relations
- Approximations and reducts with covering generalized rough sets
- Probabilistic rough set approximations
- A comparison of two types of rough sets induced by coverings
- Variable-precision dominance-based rough set approach and attribute reduction
- Reduction about approximation spaces of covering generalized rough sets
- Extensions and intensions in the rough set theory
- Reduction and axiomization of covering generalized rough sets.
- Relational interpretations of neighborhood operators and rough set approximation operators
- NMGRS: neighborhood-based multigranulation rough sets
- Multigranulation decision-theoretic rough sets
- Duality, conjugacy and adjointness of approximation operators in covering-based rough sets
- Generalized fuzzy rough approximation operators determined by fuzzy implicators
- Set-based granular computing: a lattice model
- Updating attribute reduction in incomplete decision systems with the variation of attribute set
- Evidence-theory-based numerical algorithms of attribute reduction with neighborhood-covering rough sets
- A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
- On multi-granulation covering rough sets
- Rough sets determined by tolerances
- Rough approximations on a complete completely distributive lattice with applications to generalized rough sets
- Relationships between covering-based rough sets and relation-based rough sets
- Rough sets
- A Comparative Study of Ordered and Covering Information Systems
