Open Access
Translator Disclaimer
2012 A Granular Reduction Algorithm Based on Covering Rough Sets
Tian Yang, Zhaowen Li, Xiaoqing Yang
J. Appl. Math. 2012: 1-13 (2012). DOI: 10.1155/2012/970576


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.


Download Citation

Tian Yang. Zhaowen Li. Xiaoqing Yang. "A Granular Reduction Algorithm Based on Covering Rough Sets." J. Appl. Math. 2012 1 - 13, 2012.


Published: 2012
First available in Project Euclid: 14 December 2012

zbMATH: 1251.68251
MathSciNet: MR2965708
Digital Object Identifier: 10.1155/2012/970576

Rights: Copyright © 2012 Hindawi


Vol.2012 • 2012
Back to Top