Journal of Applied Mathematics

A Granular Reduction Algorithm Based on Covering Rough Sets

Tian Yang, Zhaowen Li, and Xiaoqing Yang

Full-text: Open access

Abstract

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.

Article information

Source
J. Appl. Math., Volume 2012 (2012), Article ID 970576, 13 pages.

Dates
First available in Project Euclid: 14 December 2012

Permanent link to this document
https://projecteuclid.org/euclid.jam/1355495273

Digital Object Identifier
doi:10.1155/2012/970576

Mathematical Reviews number (MathSciNet)
MR2965708

Zentralblatt MATH identifier
1251.68251

Citation

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


Export citation