首页 | 官方网站   微博 | 高级检索  
     

基于改进的二进制分辨矩阵属性约简算法
引用本文:郭洪涛,黄广君,张孝国.基于改进的二进制分辨矩阵属性约简算法[J].计算机工程与应用,2008,44(11):158-160.
作者姓名:郭洪涛  黄广君  张孝国
作者单位:河南科技大学,电信学院,河南,洛阳,471000
基金项目:教育部科学技术重点资助项目(No.03081)
摘    要:属性约简是粗糙集理论的重要研究内容之一,目前已有许多属性约简算法。但这些算法中主要针对一致决策表,当决策表是不相容的情况下,常用的计算全部属性约简的差别矩阵算法会产生错误的结果。为了解决这个问题,引入了一个改进的二进制分辨矩阵,提出了一种基于改进的二进制分辨矩阵的属性约简算法。并利用上述算法结合实例进行属性约简,证明了算法的正确性和有效性。

关 键 词:粗糙集  决策表  二进制分辨矩阵  属性约简
文章编号:1002-8331(2008)11-0158-03
收稿时间:2007-7-31
修稿时间:2007年7月31日

Algorithm for attribute reduction based on improved binary discernibility matrix
GUO Hong-tao,HUANG Guang-jun,ZHANG Xiao-guo.Algorithm for attribute reduction based on improved binary discernibility matrix[J].Computer Engineering and Applications,2008,44(11):158-160.
Authors:GUO Hong-tao  HUANG Guang-jun  ZHANG Xiao-guo
Affiliation:Electronic &; Information Engineering College,Henan University of Science and Technology,Luoyang,Henan 471000,China
Abstract: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.
Keywords:rough set  decision table  binary discernibility matrix  attribute reduction
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号