一种基于布尔矩阵的新的属性约简完备算法  

A New Method of Complete Data Reduction Based on the Boolean Matrix

作　　者：高婷[1] 刘文奇[1] 

机构地区：[1]昆明理工大学理学院,云南昆明650093

出　　处：《计算机工程与科学》2009年第8期60-62,98,共4页Computer Engineering & Science

摘　　要：属性约简是粗糙集理论研究的核心问题之一。现已有学者证明属性约简在布尔矩阵和代数两种不同表示下是等价的,且布尔矩阵表示更加直观。基于此理论本文提出了一种基于布尔矩阵的新的属性约简完备算法,并在此基础上加了一个反向删除过程,直到不能再删为止,保证了算法的完备性。最后通过实例分析证实了其有效性。Attribute reduction is one of the key problems in the theoretical research of rough sets. The equivalence properties between the Boolean matrix representation and the algebraic representation of attributes have been proved by scholars. On this foundation, a new method of complete data reduction based on the Boolean matrix is put forward. In order to get the minimum reduction in information systems, this model adds a converse delete action until the deleteaction stops, which guarantees the completeness of the algorithm. A demonstration at the end of the paper verifies the validity of the improved method.

关 键 词：粗糙集 属性约简 布尔矩阵 反向删除 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]