计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (24): 103-105.

• 数据库、信号与信息处理 • 上一篇    下一篇

不完备决策表的差别矩阵属性约简算法

舒文豪1,徐章艳1,钱文彬1,杨炳儒2   

  1. 1.广西师范大学 计算机科学与信息工程学院,广西 桂林 541004
    2.北京科技大学 信息工程学院,北京 100083
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2011-08-21 发布日期:2011-08-21

Attribution reduction algorithm based on discernibility matrix of incomplete decision table

SHU Wenhao1,XU Zhangyan1,QIAN Wenbin1,YANG Bingru2   

  1. 1.School of Computer Science and Information Engineering,Guangxi Normal University,Guilin,Guangxi 541004,China
    2.School of Information Engineering,University of Science and Technology Beijing,Beijing 100083,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2011-08-21 Published:2011-08-21

摘要: 给出一个差别矩阵的属性约简定义,证明该属性约简的定义与广义决策属性约简的定义是等价的,对差别矩阵进行了有效的压缩。在此基础上,为求出不完备决策表的属性约简,设计了一个基于该差别矩阵的不完备决策表属性约简算法,其时间复杂度为O(|C|2|U|2),最后用实例说明了该算法的有效性。

关键词: 粗糙集, 不完备决策表, 差别矩阵, 属性约简, 算法复杂度

Abstract: The definition of attribution reduction of discernibility matrix is provided.It is proved that the above definition of attribution reduction is the same as the definition of generalized attribution reduction,the discernibility matrix is compressed.On this condition,in order to compute the attribution reduction of incomplete decision table,a new efficient attribution reduction algorithm based on discernibility matrix is designed,the time complexity of the new algorithm is O(|C|2|U|2).An example is used to illustrate the efficiency of the new algorithm.

Key words: rough set, incomplete decision table, discernibility matrix, attribution reduction, algorithm complexity