Efficient frequent pattern mining over data streams

13 years 6 months ago

Download www.cse.ust.hk

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,

Real-time Traffic

CIKM 2008 | Compact Frequency-descending Tree | Information Management | Pattern Stream Tree | Tree Restructuring Technique |

claim paper

» An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream

» Interactive Mining of Frequent Itemsets over Arbitrary Time Intervals in a Data Stream

» Verifying and Mining Frequent Patterns from Large Windows over Data Streams

» Mining adaptively frequent closed unlabeled rooted trees in data streams

» A Sliding Window Algorithm for Relational Frequent Patterns Mining from Data Streams

» Incremental Mining of Sequential Patterns over a Stream Sliding Window

» Online mining of frequent query trees over XML data streams

» A survey on algorithms for mining frequent itemsets over data streams

Post Info
More Details (n/a)

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)

Sciweavers

Efficient frequent pattern mining over data streams

CIKM 2008 | Compact Frequency-descending Tree | Information Management | Pattern Stream Tree | Tree Restructuring Technique |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers