Space Lower Bounds for Itemset Frequency Sketches

@inproceedings{Liberty2016SpaceLB,
  title={Space Lower Bounds for Itemset Frequency Sketches},
  author={Edo Liberty and Michael Mitzenmacher and Justin Thaler and Jonathan Ullman},
  booktitle={PODS},
  year={2016}
}
Given a database, computing the fraction of rows that contain a query itemset or determining whether this fraction is above some threshold are fundamental operations in data mining. A uniform sample of rows is a good sketch of the database in the sense that all sufficiently frequent itemsets and their approximate frequencies are recoverable from the sample, and the sketch size is independent of the number of rows in the original database. For many seemingly similar problems there are better… CONTINUE READING
Related Discussions
This paper has been referenced on Twitter 2 times. VIEW TWEETS