Decision reducts and bireducts in a covering approximation space and their relationship to set definability
From MaRDI portal
Publication:2330010
DOI10.1016/j.ijar.2019.03.007zbMath1460.68108OpenAlexW2926661780MaRDI QIDQ2330010
Publication date: 18 October 2019
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2019.03.007
Related Items (4)
Class-specific information measures and attribute reducts for hierarchy and systematicness ⋮ Min-max attribute-object bireducts: on unifying models of reducts in rough set theory ⋮ Topological structures induced by L-fuzzifying approximation operators ⋮ Random sampling accelerator for attribute reduction
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A semantically sound approach to Pawlak rough sets and covering-based rough sets
- Covering based rough set approximations
- Rudiments of rough sets
- Relationship between generalized rough sets based on binary relation and covering
- Rough set approach to incomplete information systems
- Rules in incomplete information systems
- Bireducts with tolerance relations
- Duality, conjugacy and adjointness of approximation operators in covering-based rough sets
- A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
- Decision bireducts and decision reducts -- a comparison
- Mathematical classification and clustering
- A Note on Definability and Approximations
- Rough Sets and Functional Dependencies in Data: Foundations of Association Reducts
- Rough sets
- A Semantical Approach to Rough Sets and Dominance-Based Rough Sets
- Computational Methods of Feature Selection
- Rough sets theory for multicriteria decision analysis
This page was built for publication: Decision reducts and bireducts in a covering approximation space and their relationship to set definability
