计算机工程与应用 ›› 2010, Vol. 46 ›› Issue (20): 96-98.DOI: 10.3778/j.issn.1002-8331.2010.20.027

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

一种改进的核增量式更新算法

冯少荣,赖桃桃,张东站   

  1. 厦门大学 计算机科学系,福建 厦门 361005
  • 收稿日期:2009-04-09 修回日期:2009-06-04 出版日期:2010-07-11 发布日期:2010-07-11
  • 通讯作者: 冯少荣

Improved incremental updating algorithm of computation of core

FENG Shao-rong,LAI Tao-tao,ZHANG Dong-zhan   

  1. Department of Computer Science,Xiamen University,Xiamen,Fujian 361005,China
  • Received:2009-04-09 Revised:2009-06-04 Online:2010-07-11 Published:2010-07-11
  • Contact: FENG Shao-rong

摘要: 深入分析基于差别矩阵的属性核快速更新算法——FUAC后,指出引起该算法空间复杂度高的原因,在此基础上提出了一种不存储差别矩阵的改进核增量式更新算法,主要考虑对象动态删除情况下核的更新问题。理论分析表明改进的核增量式更新算法有线性空间复杂度。

关键词: 粗糙集, 核, 增量式更新

Abstract: After analyzing the existence fast updating algorithm for computing an attributes core based on discernibility matrix——FUAC,this paper points out the reason that the FUAC has so high space complexity.Then an improved fast updating algorithm is proposed,which does not store discernibility matrix.Theoretical analysis shows that the improved incremental updating algorithm of the computation of a core has linear space complexity.

Key words: rough set, core, incremental updating

中图分类号: