用矩阵方法进行概念格的属性约简  

Attribute Reduction for Concept Lattice with Matrix

作　　者：王道林[1] 

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

出　　处：《泰山学院学报》2009年第6期28-32,共5页Journal of Taishan University

摘　　要：本文给出了概念格的可辨识布尔矩阵的概念,把概念格的属性分成绝对必要属性、相对必要属性和绝对不必要属性三类,建立了概念格的属性约简模型.用布尔矩阵的初等行变换把可辨识布尔矩阵化为最简矩阵,给出了通过可辨识布尔矩阵和最简矩阵判定绝对必要属性、相对必要属性和绝对不必要属性方法,并由此给出了一种初等、直观的属性约简算法.The discernible Boolean matrix of concept lattice were defined.Attributes of concept lattice were divided into absolutely necessary,relatively necessary and absolutely superfluous attributes.The model of attribute reduction for concept lattice was established.The method of transforming discernible Boolean matrix into simplest matrix by the elementary row transformation of Boolean matrix was proposed.And the necessary and sufficient conditions for determining whether the attribute was absolutely necessary,relatively necessary and absolutely superfluous were given. Finally a elementary intuitionistic attribute reduction algorithm is proposed by these necessary, and sufficient conditions.

关 键 词：概念格 属性约简 可辨识布尔矩阵 初等行变换 属性约简模型 

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