A Frequent Itemsets Mining Algorithm Based on Matrix in Sliding Window over Data Streams

According to the nature of data stream which can only scans database several times, this paper proposed a mining frequent item sets algorithm based on matrix in sliding window over data streams. The algorithm used two 0-1 matrices to store transaction and 2-itemsets, then we could get frequent item sets through some relative operation of the two matrices. Experimental results demonstrated the efficiency of the algorithm.