首页 | 本学科首页   官方微博 | 高级检索  
     

基于布尔矩阵的初等行变换的知识约简算法
引用本文:王道林. 基于布尔矩阵的初等行变换的知识约简算法[J]. 计算机应用, 2007, 27(9): 2267-2269
作者姓名:王道林
作者单位:泰山学院信息科学技术系,山东泰安271021
摘    要:给出了布尔矩阵的初等行变换定义,建立了线性逻辑方程组形式的属性约简模型,用布尔矩阵的初等行变换把系数矩阵化为最简矩阵,给出了用系数矩阵和最简矩阵判定绝对必要属性、相对必要属性和绝对不必要属性的三个充分必要条件,并由此提出了一种知识约简的快速算法。

关 键 词:最简矩阵  粗糙集  属性约简  线性逻辑方程组  布尔矩阵  初等行变换
文章编号:1001-9081(2007)09-2267-03
收稿时间:2007-03-30
修稿时间:2007-03-30

Knowledge reduction algorithm based on elementary row transformation of Boolean matrix
WANG Dao-lin. Knowledge reduction algorithm based on elementary row transformation of Boolean matrix[J]. Journal of Computer Applications, 2007, 27(9): 2267-2269
Authors:WANG Dao-lin
Abstract: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.
Keywords:rough sets  attribute reduction  Boolean matrix  elementary row transformation  linear logical equation group
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号