A granular reduction algorithm based on covering rough sets
From MaRDI portal
Summary: The granular reduction is to delete dispensable elements from a covering. It is an efficient method to reduce granular structures and get rid of the redundant information from information systems. In this paper, we develop an algorithm based on discernability matrices to compute all the granular reducts of covering rough sets. Moreover, a discernibility matrix is simplified to the minimal format. In addition, a heuristic algorithm is proposed as well such that a granular reduct is generated rapidly.
Recommendations
- A new method of reduction in covering information systems
- Reduction algorithm of covering decision systems based on discernibility set dissolving
- Application of Granular Computing in Knowledge Reduction
- A novel method for attribute reduction of covering decision systems
- Granular matrix method of attribute reduction in formal contexts
Cites work
- A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
- A systematic study on attribute reduction with rough sets based on general binary relations
- Approximations and reducts with covering generalized rough sets
- Construction of rough approximations in fuzzy setting
- Constructive and algebraic methods of the theory of rough sets
- Extensions and intensions in the rough set theory
- Generalized fuzzy rough approximation operators based on fuzzy coverings
- scientific article; zbMATH DE number 3831938 (Why is no real title available?)
- scientific article; zbMATH DE number 3980536 (Why is no real title available?)
- scientific article; zbMATH DE number 53312 (Why is no real title available?)
- scientific article; zbMATH DE number 68126 (Why is no real title available?)
- scientific article; zbMATH DE number 1182785 (Why is no real title available?)
- scientific article; zbMATH DE number 927110 (Why is no real title available?)
- Reduction about approximation spaces of covering generalized rough sets
- Reduction and axiomization of covering generalized rough sets.
- Related family: a new method for attribute reduction of covering information systems
- Relational interpretations of neighborhood operators and rough set approximation operators
- Relationship between generalized rough sets based on binary relation and covering
- Rough approximations on a complete completely distributive lattice with applications to generalized rough sets
- Rough fuzzy approximations on two universes of discourse
- Rough sets and current trends in computing. 1st international conference, RSCTC '98, Warsaw, Poland, June 22--26, 1998. Proceedings
- Rough sets in knowledge discovery 1. Methodology and applications
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- Topological approaches to covering rough sets
Cited in
(7)- Semi-monolayer cover rough set: concept, property and granular algorithm
- A rough set method for the vertex cover problem in graph theory
- scientific article; zbMATH DE number 5004268 (Why is no real title available?)
- A new method of reduction in covering information systems
- Reduction algorithm of covering decision systems based on discernibility set dissolving
- Application of Granular Computing in Knowledge Reduction
- Incremental reduction methods based on granular ball neighborhood rough sets and attribute grouping
This page was built for publication: A granular reduction algorithm based on covering rough sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1760906)
