A granular reduction algorithm based on covering rough sets (Q1760906): Difference between revisions
From MaRDI portal
Latest revision as of 21:41, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A granular reduction algorithm based on covering rough sets |
scientific article |
Statements
A granular reduction algorithm based on covering rough sets (English)
0 references
15 November 2012
0 references
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.
0 references
covering rough sets
0 references
granularity
0 references
discernability matrix
0 references
0 references
0 references
0 references
