doi:10.1093/comjnl/bxs010 An Efficient Frequent Itemset Mining Method over High-speed Data Streams

Frequent itemset mining over sliding window is an interesting problem and has a large number of applications. Sliding window is a widely used model for frequent itemset mining over data streams due to its capability to handle concept drift, its bounded memory and its low processing time.A sliding window-based algorithm requires an efficient data structure that can be updated as fast as possible when inserting and deleting transactions. Moreover, an innovative computing method is needed to provide the set of frequent patterns (FPs) with a little delay after the user issues a request for the mining results within a window. In this study, an efficient representation of the sliding window named blocked bit sequence is introduced which is aimed to store and maintain the content of the window. Moreover, by a novel technique this representation is exploited for efficiently extracting the set of FPs within the current window. Experimental evaluations on both real-life and synthetic data streams show that the proposed approach is faster than recently proposed algorithms in different phases of data stream mining