On the estimation of frequent itemsets for data streams: theory and experiments

Authors:
Pierre-Alain Laur;Richard Nock;Jean-Emile Symphor;Pascal Poncelet
Affiliations:
U. Antilles-Guyane, Martinique, France;U. Antilles-Guyane, Martinique, France;U. Antilles-Guyane, Martinique, France;Lg2ip-Mines d'Alès, France
Venue:
Proceedings of the 14th ACM international conference on Information and knowledge management
Year:
2005

Citing 3
Cited 0

Some PAC-Bayesian Theorems

Machine Learning - The Eleventh Annual Conference on computational Learning Theory
Levelwise Search and Borders of Theories in KnowledgeDiscovery

Data Mining and Knowledge Discovery
Statistical supports for frequent itemsets on data streams

MLDM'05 Proceedings of the 4th international conference on Machine Learning and Data Mining in Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we devise a method for the estimation of the true support of itemsets on data streams, with the objective to maximize one chosen criterion among {precision, recall} while ensuring a degradation as reduced as possible for the other criterion. We discuss the strengths, weaknesses and range of applicability of this method that relies on conventional uniform convergence results, yet guarantees statistical optimality from different standpoints.