Journal of Applied Mathematics
Volume 2012 (2012), Article ID 970576, 13 pages
Research Article

A Granular Reduction Algorithm Based on Covering Rough Sets

1College of Science, Central South University of Forestry and Technology, Changsha 410004, China
2College of Mathematics and Computer Science, Guangxi University for Nationalities, Nanning 530006, China
3School of Economics and Management, Changsha University of Science and Technology, Changsha 410004, China

Received 31 March 2012; Revised 12 July 2012; Accepted 16 July 2012

Academic Editor: Chong Lin

Copyright © 2012 Tian Yang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.