A novel approach for mining probabilistic frequent itemsets over uncertain data streams

With the growing popularity of internet of things (IoT) and pervasive computing, a large amount of uncertain data has been collected. Frequent itemsets mining has attracted much attention in database and data mining communities. Current methods exists some disadvantages, such as inaccurate, low efficiency, etc. To address this problem, we propose a novel approach, called uncertain pattern-slide window algorithm (UP-SW) is presented. In this algorithm, a new tree structure called USFP-tree is designed to save the redeveloped header table; the model of slide-window is adopted into the renewal process of mining result. The USFP-tree is structured based on dynamic array (ARRAY) and link information (LINK), as the slide-window slides, the mining result saved in USFP-tree is refreshed. The probabilistic frequent itemsets are obtained by traversing the final ARRAY of header table. Experimental results and theoretical analysis show that UP-SW has better performance than several other UP algorithms, especially on the mining efficiency and reducing the memory usage.