Granular structures of covering-based rough set approximations through the Mapper algorithm
From MaRDI portal
Cites work
- A novel covering rough set model based on granular-ball computing for data with label noise
- A semantically sound approach to Pawlak rough sets and covering-based rough sets
- Artificial Intelligence and Soft Computing - ICAISC 2004
- Cluster Analysis
- Computational and Information Science
- Covering based rough set approximations
- Duality, conjugacy and adjointness of approximation operators in covering-based rough sets
- scientific article; zbMATH DE number 3880694 (Why is no real title available?)
- scientific article; zbMATH DE number 7307480 (Why is no real title available?)
- Information systems theoretical foundations
- Mapper-based rough sets
- Matrix-based set approximations and reductions in covering decision information systems
- Neighborhood operators for covering-based rough sets
- On some types of neighborhood-related covering rough sets
- Optimizations of approximation operators in covering rough set theory
- Partial order relation for approximation operators in covering based rough sets
- Rough sets
- Rough sets theory for multicriteria decision analysis
- Rough sets, coverings and incomplete information
- Statistical analysis and parameter selection for Mapper
- Transactions on Rough Sets I
This page was built for publication: Granular structures of covering-based rough set approximations through the Mapper algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6888581)