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-nodeis 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 ...
| 
推荐 
点击下列相关研究机构和相关文献作者，可以直接查到这些机构和作者被《中国知识资源总库》收录的其它文献，使您全面了解该机构和该作者的研究动态和历史。
