Efficient frequent pattern mining over data streams

Authors:
Syed Khairuzzaman Tanbeer;Chowdhury Farhan Ahmed;Byeong-Soo Jeong;Young-Koo Lee
Affiliations:
Kyung Hee University, Youngin-si, Kyunggi-do, South Korea;Kyung Hee University, Youngin-si, Kyunggi-do, South Korea;Kyung Hee University, Youngin-si, Kyunggi-do, South Korea;Kyung Hee University, Youngin-si, Kyunggi-do, South Korea
Venue:
Proceedings of the 17th ACM conference on Information and knowledge management
Year:
2008

Citing 3
Cited 5

Mining frequent patterns without candidate generation

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
DSTree: A Tree Structure for the Mining of Frequent Sets from Data Streams

ICDM '06 Proceedings of the Sixth International Conference on Data Mining
CP-tree: a tree structure for single-pass frequent pattern mining

PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining

Online mining of temporal maximal utility itemsets from data streams

Proceedings of the 2010 ACM Symposium on Applied Computing
An approach for adaptive associative classification

Expert Systems with Applications: An International Journal
A sliding window-based false-negative approach for ubiquitous data stream analysis

International Journal of Communication Systems
Interactive mining of high utility patterns over data streams

Expert Systems with Applications: An International Journal
Kernel-Tree: mining frequent patterns in a data stream based on forecast support

AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.