基于布尔矩阵的初等行变换的知识约简算法  

Knowledge reduction algorithm based on elementary row transformation of Boolean matrix

作　　者：王道林[1] 

机构地区：[1]泰山学院信息科学技术系,山东泰安271021

出　　处：《计算机应用》2007年第9期2267-2269,共3页journal of Computer Applications

基　　金：国家自然科学基金资助项目(60572113)

摘　　要：给出了布尔矩阵的初等行变换定义,建立了线性逻辑方程组形式的属性约简模型,用布尔矩阵的初等行变换把系数矩阵化为最简矩阵,给出了用系数矩阵和最简矩阵判定绝对必要属性、相对必要属性和绝对不必要属性的三个充分必要条件,并由此提出了一种知识约简的快速算法。The definition of elementary row transformation of Boolean matrix was given. Attribute reduction model in the form of linear logical equation group was established. Coefficient matrix was transformed into simplest matrix by elementary row transformation of Boolean matrix. Three necessary and sufficient conditions to determine whether the attribute was absolutely necessary, relatively necessary and absolutely superfluous were given by coefficient matrix and simplest matrix, and a fast knowledge reduction algorithm was proposed.

关 键 词：粗糙集 属性约简 布尔矩阵 初等行变换 线性逻辑方程组 

分 类 号：TP311.131[自动化与计算机技术—计算机软件与理论]