首页 | 本学科首页   官方微博 | 高级检索  
     

基于数据库的属性约简模型的快速求核算法
引用本文:姜伟,徐章艳,杨炳儒. 基于数据库的属性约简模型的快速求核算法[J]. 计算机工程与应用, 2007, 43(16): 189-190
作者姓名:姜伟  徐章艳  杨炳儒
作者单位:辽宁师范大学,数学学院,辽宁,大连,116029;北京科技大学,信息工程学院,北京,100083;广西师范大学,计算机系,广西,桂林,541004;北京科技大学,信息工程学院,北京,100083
基金项目:辽宁省教育厅资助科研课题
摘    要:对于基于数据库系统的属性约简模型,给出相应的简化差别矩阵和相应核的定义,并证明该核与基于数据库系统的属性约简模型的核是等价的。在此基础上设计了一个新的求核算法,其时间复杂度和空间复杂度分别为max{O(|C||U/C|2),O(|C||U|)}和O(|U|)。

关 键 词:粗糙集  属性约简  简化差别矩阵    复杂度
文章编号:1002-8331(2007)16-0189-02
修稿时间:2006-09-01

Quick computing core algorithm for attribute reduction model based on database
JIANG Wei,XU Zhang-yan,YANG Bing-ru. Quick computing core algorithm for attribute reduction model based on database[J]. Computer Engineering and Applications, 2007, 43(16): 189-190
Authors:JIANG Wei  XU Zhang-yan  YANG Bing-ru
Affiliation: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
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.
Keywords:Rough Set  attribute reduction  simplified discernibility matrix  core  complexity
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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