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

一种基于C-Tree的属性约简增量式更新算法
引用本文:杨明,吕静. 一种基于C-Tree的属性约简增量式更新算法[J]. 控制与决策, 2012, 27(12): 1769-1775
作者姓名:杨明  吕静
作者单位:南京师范大学计算机科学与技术学院,南京,210046
基金项目:国家自然科学基金项目(60873176,61003116,61272222);江苏省自然科学基金重点重大专项项目(BK2011005),江苏省自然科学基金项目(BK2011782,BK2010263)
摘    要:针对以往文献为克服基于差别矩阵的属性约简算法存储代价高的不足而提出的基于浓缩树(C-Tree)的高效属性约简算法仅考虑决策表不变的情况,提出了一种基于C-Tree的属性约简增量式更新算法,主要考虑对象动态增加情况下属性约简的更新问题.该算法可通过快速更新C-Tree,在动态求解核的基础上,利用原有的属性约简有效地进行属性约简的增量式更新.理论分析和实验结果表明,所提出的算法是有效可行的.

关 键 词:粗糙集  差别矩阵  浓缩树    属性约简  增量式更新
收稿时间:2011-07-20
修稿时间:2012-01-03

An incremental updating algorithm for attribute reduction based on
C-Tree
YANG Ming,LV Jing. An incremental updating algorithm for attribute reduction based on
C-Tree[J]. Control and Decision, 2012, 27(12): 1769-1775
Authors:YANG Ming  LV Jing
Affiliation:(School of Computer Science and Technology,Nanjing Normal University,Nanjing 210046,China)
Abstract:

To overcome the disadvantage of those attribute reduction algorithms based on the discernibility matrix with high
space complexity, a compact storage structure called condensing tree(C-Tree) and corresponding efficient algorithms for
attribute reduction are introduced in the existing reference, respectively. However, the mentioned algorithms in the reference
only consider the case of the static decision table. Therefore, an incremental updating algorithm is proposed for attribute
reduction based on C-Tree in the case of inserting, which only needs to modify the related nodes in the corresponding paths
when updating the C-Tree. After dynamically computing a core, attribute reduction can be effectively updated by utilizing
the old attribute reduction. Theoretical analysis and experiments show that the proposed algorithm is effective and feasible.

Keywords:

rough set|discernibility matrix|C-Tree|core|attribute reduction|incremental updating

本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《控制与决策》浏览原始摘要信息
点击此处可从《控制与决策》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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