Journal of Applied Mathematics
- J. Appl. Math.
- Volume 2012 (2012), Article ID 970576, 13 pages.
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 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.
J. Appl. Math., Volume 2012 (2012), Article ID 970576, 13 pages.
First available in Project Euclid: 14 December 2012
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Yang, Tian; Li, Zhaowen; Yang, Xiaoqing. A Granular Reduction Algorithm Based on Covering Rough Sets. J. Appl. Math. 2012 (2012), Article ID 970576, 13 pages. doi:10.1155/2012/970576. https://projecteuclid.org/euclid.jam/1355495273