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

基于可辨识布尔矩阵的协调决策表的属性约简
引用本文:王道林,崔进平.基于可辨识布尔矩阵的协调决策表的属性约简[J].计算机工程,2008,34(10):95-97.
作者姓名:王道林  崔进平
作者单位:泰山学院信息科学技术系,泰安,271021
摘    要:将条件属性分成核心属性、相对必要属性和绝对不必要属性,给出协调决策表的快速属性约简算法。提出协调决策表的可辨识布尔矩阵和布尔矩阵的初等行变换的概念,建立属性约简的数学模型。用布尔矩阵的初等行变换把可辨识布尔矩阵化为最简矩阵,给出通过可辨识布尔矩阵和最简矩阵判定3种条件属性的3个充分必要条件以及一种新的属性约简算法。

关 键 词:粗糙集  协调决策表  属性约简  可辨识布尔矩阵  初等行变换
文章编号:1000-3428(2008)10-0095-03
修稿时间:2007年7月20日

Attribute Reduction for Consistent Decision Table Based on Discernible Boolean Matrix
WANG Dao-lin,CUI Jin-ping.Attribute Reduction for Consistent Decision Table Based on Discernible Boolean Matrix[J].Computer Engineering,2008,34(10):95-97.
Authors:WANG Dao-lin  CUI Jin-ping
Affiliation:(Department of Information Science and Technology, Taishan College, Tai’an 271021)
Abstract: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.
Keywords:rough sets  consistent decision table  attribute reduction  discernible Boolean matrix  elementary row transformation
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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