An adaptive algorithm for finding frequent sets in landmark windows

Authors:
Xuan Hong Dang;Kok-Leong Ong;Vincent Lee
Affiliations:
Dept. of Computer Science, Aarhus University, Denmark;School of IT, Deakin University, Australia;Faculty of IT, Monash University, Australia
Venue:
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
Year:
2012

Citing 7
Cited 0

Finding recent frequent itemsets adaptively over online data streams

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Load Shedding for Aggregation Queries over Data Streams

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
The complexity of mining maximal frequent itemsets and maximal frequent patterns

Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Adaptive load shedding for windowed stream joins

Proceedings of the 14th ACM international conference on Information and knowledge management
False positive or false negative: mining frequent itemsets from high speed transactional data streams

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Staying FIT: efficient load shedding techniques for distributed stream processing

VLDB '07 Proceedings of the 33rd international conference on Very large data bases
A parallel, distributed algorithm for relational frequent pattern discovery from very large data sets

Intelligent Data Analysis - Ubiquitous Knowledge Discovery

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a CPU constrained environment for finding approximation of frequent sets in data streams using the landmark window. Our algorithm can detect overload situations, i.e., breaching the CPU capacity, and sheds data in the stream to "keep up". This is done within a controlled error threshold by exploiting the Chernoff-bound. Empirical evaluation of the algorithm confirms the feasibility.