A granular reduction algorithm based on covering rough sets (Q1760906)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A granular reduction algorithm based on covering rough sets |
scientific article; zbMATH DE number 6106359
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A granular reduction algorithm based on covering rough sets |
scientific article; zbMATH DE number 6106359 |
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
0.8156760334968567
0 references
0.8115618228912354
0 references
0.8016380667686462
0 references
0.7931696772575378
0 references
0.7912566065788269
0 references
