作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2009, Vol. 35 ›› Issue (13): 37-39. doi: 10.3969/j.issn.1000-3428.2009.13.013

• 软件技术与数据库 • 上一篇    下一篇

基于滑动窗口的数据流频繁闭项集挖掘

李 俊,杨天奇   

  1. (暨南大学信息科学与技术学院,广州 510632)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-07-05 发布日期:2009-07-05

Data Stream Frequent Closed Itemsets Mining Based on Sliding Window

LI Jun, YANG Tian-qi   

  1. (College of Information Science and Technology, Jinan University, Guangzhou 510632)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-07-05 Published:2009-07-05

摘要: 针对数据流的特点,根据Moment算法提出一种基于频繁闭项集挖掘的增量式维护算法。该算法通过滑动窗口增量更新数据流中的事务,采取一种高效的项的位序列表示方法降低窗口滑动的时间和空间复杂度,应用压缩的模式树进行频繁闭项集检查,以确保挖掘结果的准确性。实验证明了该方法的有效性。

关键词: 滑动窗口, 数据流, 频繁闭项集, Moment算法

Abstract: Aiming at the features of data streams, this paper presents an incremental maintaining algorithm based on frequent closed itemsets mining according to Moment algorithm. It incrementally updates the transactions in the data stream via a sliding window, and uses an effective bit-sequence representation of items to reduce time and memory of the sliding window. A compressed pattern tree is used in frequent closed itemsets test to guarantee veracity. Experimental results show that this algorithm is effective.

Key words: sliding window, data stream, frequent closed itemsets, Moment algorithm

中图分类号: