计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (1): 159-161.DOI: 10.3778/j.issn.1002-8331.2011.01.044

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

一个计算Skowron差别矩阵核的新算法

蒙 韧1,徐章艳2,3,杨炳儒3   

  1. 1.广西师范大学 财务处,广西 桂林 541004
    2.广西师范大学 计算机系,广西 桂林 541004
    3.北京科技大学 信息工程学院,北京 100083
  • 收稿日期:2009-04-13 修回日期:2009-06-05 出版日期:2011-01-01 发布日期:2011-01-01
  • 通讯作者: 蒙 韧

New algorithm for computing core of Skowron discernibility matrix

MENG Ren1,XU Zhangyan2,3,YANG Bingru3   

  1. 1.Finance Office,Guangxi Normal University,Guilin,Guangxi 541004,China
    2.Department of Computer,Guangxi Normal University,Guilin,Guangxi 541004,China
    3.School of Information Engineering,University of Science and Technology Beijing,Beijng 100083,China

  • Received:2009-04-13 Revised:2009-06-05 Online:2011-01-01 Published:2011-01-01
  • Contact: MENG Ren

摘要: 为提高基于Skowron差别矩阵的求核算法的效率,引入简化决策表的定义,给出了简化Skowron差别矩阵和相应核的定义,证明了新核与基于Skowron差别矩阵的核是一致的。提出一个基于Skowron差别矩阵的快速求核新算法,其时间复杂度和空间复杂度分别降为[max{O(|C||U/C|2),O(|C||U|)}]和[max{O(|U|),O(|C|)}]。

Abstract: To improve the efficiency of the algorithm for computing the core of the Skowron discernibility matrix,the simplified decision table is first provided.At the same time,the simplified Skowron discernibility matrix and its corresponding core are proposed.And it is proved that the new core is the same as the core of Skowron discernibility matrix.Then a new algorithm for computing the core of Skowron discernibility matrix is designed.The time and space complexity of the new algorithm are cut down [max{O(|C||U/C|2),O(|C||U|)}] and [max{O(|U|),O(|C|)}] respectively.

中图分类号: