A Granular Reduction Algorithm Based on Covering Rough Sets
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 matrixes to compute all the granular re...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2012-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2012/970576 |
| 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 matrixes 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. |
|---|---|
| ISSN: | 1110-757X 1687-0042 |