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

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

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

CLC Number: 

• TP311.13