摘要： 属性约简是粗糙集理论研究中的核心内容之一，现已证明寻找最小约简是NP-hard问题。该文对信息系统中属性的条件区分能力给出定义。在此基础上，提出了一种基于条件区分能力的属性约简的启发式算法。通过实例分析表明，在多数情况下该算法能够得到信息系统的最小约简。

关键词: 粗糙集, 布尔矩阵, 属性约简, 启发式算法

Abstract: Attribute reduction is one of the key topics of rough set theory. Search for minimum reduction has been proved to be a NP-hard problem. The definition of attribute condition distinguish ability is given in information system. On this basis, a heuristic algorithm of attribute reduction based on the conception of the condition distinguish ability is put forward. By analyzing the example, it is indicated that this algorithm can get the minimum reduction in information system under most situations.

Key words: Rough set, Boolean matrix, Attribute reduction, Heuristic algorithm

中图分类号: 

• TP18