Efficient frequent pattern mining over data streams
Efficient frequent pattern mining over data streams
复制标题
DOI：
10.1145/1458082.1458326
复制
发表时间：
2008-10
期刊：
影响因子：
--
通讯作者：
S. Tanbeer;Chowdhury Farhan Ahmed;Byeong-Soo Jeong;Young-Koo Lee
中科院分区：
文献类型：
--
作者：
S. Tanbeer;Chowdhury Farhan Ahmed;Byeong-Soo Jeong;Young-Koo Lee
本文提出了一种称为 CPS 树（紧凑模式流树）的前缀树结构，它可以有效地从高速数据流中发现精确的最近频繁模式集。 CPS-tree在处理流数据时引入了动态树重组技术的概念，使其能够在运行时实现高度紧凑的频率下降树结构，并促进高效的基于FP增长的[1]挖掘技术。
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.