ML Anthology

Min-D-Occur: Ensuring Future Occurrences in Streaming Sets

Vidit Jain, Sainyam Galhotra
UAI 2014 pp. 370-379
/uai/2014/jain2014uai-min/

Abstract

Given a set of n elements and a corresponding stream of its subsets, we consider the problem of selecting k elements that should appear in at least d such subsets arriving in the “near” future with high probability. For this min-d-occur problem, we present an algorithm that provides a solution with the success proba-bility of at least 1 − O kd logn

PDF UAI Semantic Scholar

Cite

Text

Jain and Galhotra. "Min-D-Occur: Ensuring Future Occurrences in Streaming Sets." Conference on Uncertainty in Artificial Intelligence, 2014.

Markdown

[Jain and Galhotra. "Min-D-Occur: Ensuring Future Occurrences in Streaming Sets." Conference on Uncertainty in Artificial Intelligence, 2014.](https://mlanthology.org/uai/2014/jain2014uai-min/)

BibTeX

@inproceedings{jain2014uai-min,
  title     = {{Min-D-Occur: Ensuring Future Occurrences in Streaming Sets}},
  author    = {Jain, Vidit and Galhotra, Sainyam},
  booktitle = {Conference on Uncertainty in Artificial Intelligence},
  year      = {2014},
  pages     = {370-379},
  url       = {https://mlanthology.org/uai/2014/jain2014uai-min/}
}