On the estimation of frequent itemsets for data streams: theory and experiments
Lists
Only you see this
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.
BibTeX
@inproceedings{laur2005estimation,
author = {Pierre-Alain Laur and Richard Nock and Jean-Emile Symphor and Pascal Poncelet},
title = {{On the estimation of frequent itemsets for data streams: theory and experiments}},
booktitle = {ACM International Conference on Information and Knowledge Management},
year = {2005},
url = {https://openreview.net/forum?id=bTgpSqB-kP},
}Loading related content...