Aiming at the problem that FP-growth algorithm can not adapt to the data stream with the characteristics of infinity and fluidity, this paper presents a novel variation structure of FP-tree called FPS-tree, which captures all database information in current window with one scan. For effectively deleting expired panes in sliding window, a novel concept-＂tail-node＂ is proposed, so the information on pane in every path of FPS-tree is only retained in the tail-node. Experimental results show that compact performance of the FPS-tree...
