Knowledge reduction of dynamic covering decision information systems when varying covering cardinalities
From MaRDI portal
Publication:1991878
DOI10.1016/J.INS.2016.01.099zbMath1398.68544OpenAlexW2264162531MaRDI QIDQ1991878
Duoqian Miao, Tian Yang, Guangming Lang, Mingjie Cai
Publication date: 30 October 2018
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2016.01.099
rough setcharacteristic matrixdynamic covering approximation spacedynamic covering decision information system
Related Items (4)
A comparison study of similarity measures for covering-based neighborhood classifiers ⋮ Attribute reduction based on \(k\)-nearest neighborhood rough sets ⋮ Three-way decision approaches to conflict analysis using decision-theoretic rough set theory ⋮ Updating reducts in fuzzy \(\beta \)-covering via matrix approaches while coarsening and refining a covering element
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rough sets based matrix approaches with dynamic attribute variation in set-valued information systems
- A rough set-based incremental approach for learning knowledge in dynamic incomplete information systems
- Rough set approach to incomplete numerical data
- The relationship among different covering approximations
- A novel method for attribute reduction of covering decision systems
- Composite rough sets for dynamic data mining
- Dynamic maintenance of approximations in set-valued ordered decision systems under the attribute generalization
- Partial order relation for approximation operators in covering based rough sets
- Fast algorithms for computing rough approximations in set-valued decision systems while updating criteria values
- The approximation number function and the characterization of covering approximation space
- Covering rough sets based on neighborhoods: an approach without using neighborhoods
- Incremental learning optimization on knowledge discovery in dynamic business intelligent systems
- Covering based rough set approximations
- Generalized approximations defined by non-equivalence relations
- Characteristic matrix of covering and its application to Boolean matrix decomposition
- Reduction about approximation spaces of covering generalized rough sets
- Relationship between generalized rough sets based on binary relation and covering
- Discernibility matrix simplification for constructing attribute reducts
- Characterizations of coverings for upper approximation operators being closure operators
- On measurements of covering rough sets based on granules and evidence theory
- Relational interpretations of neighborhood operators and rough set approximation operators
- Neighborhood operator systems and approximations
- Matrix-based set approximations and reductions in covering decision information systems
- Rule acquisition and complexity reduction in formal decision contexts
- Updating attribute reduction in incomplete decision systems with the variation of attribute set
- A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
- Incomplete decision contexts: approximate concept construction, rule acquisition and knowledge reduction
- Relationship among basic concepts in covering-based rough sets
- On multi-granulation covering rough sets
- Measuring roughness of generalized rough sets induced by a covering
- Knowledge acquisition in incomplete information systems: a rough set approach
- Homomorphisms Between Covering Approximation Spaces
- Homomorphisms-based attribute reduction of dynamic fuzzy covering information systems
- A rough set based dynamic maintenance approach for approximations in coarsening and refining attribute values
- An Incremental Approach for Inducing Knowledge from Dynamic Information Systems
This page was built for publication: Knowledge reduction of dynamic covering decision information systems when varying covering cardinalities
