关键词: 数据流, 滑动窗口, 最大频繁项集, 矩阵

Abstract: The number of itemsets in data stream maximum frequent itemsets is relatively few and has implied all frequent itemsets, so mining data stream maximum frequent itemsets has better efficiency in time and space and has great significance. It has gotten more attention by the industry. In view of the data stream maximum frequent itemsets, this paper proposes a mining method called SWM-MFI based on matrix of data stream maximum frequent itemsets in sliding window. The method stores the data information using two Matrixes：one called transaction matrix stores the transaction data and the other one called 2-itemsets matrix stores frequent 2-itemsets. Frequent k-itemsets can be got through the 2-itemsets matrix and the maximum frequent itemsets can be mined based on the method of SWM-MFI. The theories and experiments show that the method is better on time efficiency.

Key words: data stream, sliding window, maximum frequent itemsets, matrix