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 theredundant information from information systems. In this paper, we developan algorithm based on discernability matrixes to compute all the granularreducts of covering rough sets. Moreover, a discernibility matrix is simplifiedto the minimal format. In addition, a heuristic algorithm is proposed as wellsuch that a granular reduct is generated rapidly.

[学科分类] 应用数学