Sciweavers

Share
CIKM
2008
Springer

Efficient frequent pattern mining over data streams

8 years 6 months ago
Efficient frequent pattern mining over data streams
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. Categories and Subject Descriptors: H.2.8 [Database Management]: Database Applications
Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed,
Added 12 Oct 2010
Updated 12 Oct 2010
Type Conference
Year 2008
Where CIKM
Authors Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong, Young-Koo Lee
Comments (0)
books