现代数据工程与实时计算实验室
 

论文发表

Mining Frequent Patterns in an Arbitrary Sliding Window over Data Streams


作者

Guohui Li, Hui Chen, Bing Yang, Gang Chen

期刊

期刊名称:Springer Berlin Heidelberg
出版日期:2008
所在页数:496-503

摘要

This paper proposes a method for mining the frequent patterns in an arbitrary sliding window of data streams. As streams flow, the contents of which are captured with SWP-tree by scanning the stream only once, and the obsolete and infrequent patterns are deleted by periodically pruning the tree. To differentiate the patterns of recently generated transactions from those of historic transactions, a time decaying model is also applied. The experimental results show that the proposed method is efficient and scalable, and it is superior to other analogous algorithms.

关键词

SWP-tree

[pdf]

地址:湖北省武汉市洪山区珞瑜路1037号,华中科技大学南一楼西南501室 邮编:430074 电话:027-87556601
计算机科学与技术学院,现代数据工程与实时计算实验室 有问题和意见请与网站管理员联系:adelab@163.com

温馨提示:为保证能正常的浏览此网站,请用IE9.0以上版本查看!    访问人次: