基于改进的二进制分辨矩阵属性约简算法  

Algorithm for attribute reduction based on improved binary discernibility matrix

作　　者：郭洪涛[1] 黄广君[1] 张孝国[1] 

机构地区：[1]河南科技大学电信学院,河南洛阳471000

出　　处：《计算机工程与应用》2008年第11期158-160,164,共4页Computer Engineering and Applications

基　　金：教育部科学技术重点资助项目(No.03081)

摘　　要：属性约简是粗糙集理论的重要研究内容之一,目前已有许多属性约简算法。但这些算法中主要针对一致决策表,当决策表是不相容的情况下,常用的计算全部属性约简的差别矩阵算法会产生错误的结果。为了解决这个问题,引入了一个改进的二进制分辨矩阵,提出了一种基于改进的二进制分辨矩阵的属性约简算法。并利用上述算法结合实例进行属性约简,证明了算法的正确性和有效性。Attributes reduction is one of important parts researched in rough set theory,thus,many algorithms have been proposed for attributes reduction,unfortunately,these algorithms based on discernibility matrix mainly aim at the consistent decision table, and can not get a correct result for an inconsistent decision table in some cases,therefore,in this paper,an algorithm for attribute reduction based on improved binary discernibility matrix,this algorithm is suitable for any decision tables.Finally,some examples are shown that the minimal reduction of similar information systems can be obtained by using the algorithm.

关 键 词：粗糙集 决策表 二进制分辨矩阵 属性约简 

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