Efficient frequent pattern mining over data streams

Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong, Young-Koo Lee
2008 Proceeding of the 17th ACM conference on Information and knowledge mining - CIKM '08  
This paper proposes a prefix-tree structure, called CPS-tree (Compact Pattern Stream tree) that efficiently discovers the exact set of recent frequent patterns from high-speed data stream. The CPS-tree introduces the concept of dynamic tree restructuring technique in handling stream data that allows it to achieve highly compact frequency-descending tree structure at runtime and facilitates an efficient FP-growth-based [1] mining technique.
doi:10.1145/1458082.1458326 dblp:conf/cikm/TanbeerAJL08 fatcat:fwinusdhgvcfxpxva7izmtfcf4