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

基于树与链表的关联规则增量更新的实现
引用本文:胡锦美.基于树与链表的关联规则增量更新的实现[J].闽江学院学报,2005,26(5):54-57.
作者姓名:胡锦美
作者单位:闽江学院计算机科学系,福建,福州,350108
基金项目:闽江学院科技育苗项目[YSY03013]
摘    要:针对两次挖掘的增量更新算法具体实现时所采用的数据结构作了重点讨论分析,提出了一种高效存储处理频繁项目集集合的数据结构--树与链表,并介绍了在树与链表上的操作.最后在模拟数据的基础上,验证了树与链表数据结构对算法的效率影响,实验结果表明树与链表适用于两次挖掘关联规则增量更新时数据存储.

关 键 词:数据挖掘  关联规则  增量更新    链表
文章编号:1009-7821(2005)05-054-04
收稿时间:2005-06-22
修稿时间:2005年6月22日

Implementation of Incremental Updating For Mining Association Rules Based on Tree and List
HU Jin-mei.Implementation of Incremental Updating For Mining Association Rules Based on Tree and List[J].Journal of Minjiang University,2005,26(5):54-57.
Authors:HU Jin-mei
Abstract:To meet the need of a proposed algorithm of incremental updating for data mining, a kind of data structure on which the implementation of the algorithm relies is thoroughly discussed in this paper. The new data structuretree and list, which store and process frequent item sets effficiently,and the related operations on them are presented at the same time. With simulated data, the impact of tree and list on the efficiency of the algorithm are proven at last. Experimental results indicate that tree and list are suitable for data storeage in the algorithm procedure.
Keywords:Data Mining  Association Rules  Incremental Updating  tree  list
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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