基于可辨识布尔矩阵的协调决策表的属性约简  

Attribute Reduction for Consistent Decision Table Based on Discernible Boolean Matrix

作　　者：王道林[1] 崔进平[1] 

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

出　　处：《计算机工程》2008年第10期95-97,共3页Computer Engineering

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

摘　　要：将条件属性分成核心属性、相对必要属性和绝对不必要属性,给出协调决策表的快速属性约简算法。提出协调决策表的可辨识布尔矩阵和布尔矩阵的初等行变换的概念,建立属性约简的数学模型。用布尔矩阵的初等行变换把可辨识布尔矩阵化为最简矩阵,给出通过可辨识布尔矩阵和最简矩阵判定3种条件属性的3个充分必要条件以及一种新的属性约简算法。In order to give a fast attribute reduction algorithm of the consistent decision table, the condition attributes are divided into three sorts： core attribute, relatively necessary attribute and absolutely superfluous attribute. Two definitions called discernible Boolean matrix of consistent decision table and elementary row transformation of Boolean matrix are given. A model related to attribute reduction is established. Discernible Boolean matrix can be transformed into the simplest matrix by the elementary row transformation proposed in this paper. Three necessary and sufficient conditions for determining the attributes are given. A novel attribute reduction algorithm is proposed by these necessary and sufficient conditions.

关 键 词：粗糙集 协调决策表 属性约简 可辨识布尔矩阵 初等行变换 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]