计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (16): 189-190.

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

基于数据库的属性约简模型的快速求核算法

姜 伟1,徐章艳2,3,杨炳儒2   

  1. 1.辽宁师范大学 数学学院,辽宁 大连 116029
    2.北京科技大学 信息工程学院,北京 100083
    3.广西师范大学 计算机系,广西 桂林 541004
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-06-01 发布日期:2007-06-01
  • 通讯作者: 姜 伟

Quick computing core algorithm for attribute reduction model based on database

JIANG Wei1,XU Zhang-yan2,3,YANG Bing-ru2   

  1. 1.School of Mathematics,Liaoning Normal University,Dalian,Liaoning 116029,China
    2.School of Information Engineering,University of Science and Technology Beijing,Beijng 100083,China
    3.Department of Computer,Guangxi Normal University,Guilin,Guangxi 541004,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-06-01 Published:2007-06-01
  • Contact: JIANG Wei

摘要: 对于基于数据库系统的属性约简模型,给出相应的简化差别矩阵和相应核的定义,并证明该核与基于数据库系统的属性约简模型的核是等价的。在此基础上设计了一个新的求核算法,其时间复杂度和空间复杂度分别为max{O(|C||U/C|2),O(|C||U|)}和O(|U|)。

Abstract: In this paper,the definitions of a simplified discernibility matrix and the corresponding core are provided for attribute reduction model based on database system.It is proved that this core is equal to the core of attribute reduction model based on database system.On this condition,a new computing core algorithm is designed,and its time complexity and space complexity are max{O(|C||U/C|2),O(|C||U|)} and O(|U|) respectively.