Approximating a collection of frequent sets

@inproceedings{Afrati2004ApproximatingAC,
  title={Approximating a collection of frequent sets},
  author={Foto N. Afrati and Aristides Gionis and Heikki Mannila},
  booktitle={KDD},
  year={2004}
}
One of the most well-studied problems in data mining is computing the collection of frequent item sets in large transactional databases. One obstacle for the applicability of frequent-set mining is that the size of the output collection can be far too large to be carefully examined and understood by the users. Even restricting the output to the border of the frequent item-set collection does not help much in alleviating the problem.In this paper we address the issue of overwhelmingly large… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 171 citations. REVIEW CITATIONS

6 Figures & Tables

Topics

Statistics

01020'05'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

171 Citations

Semantic Scholar estimates that this publication has 171 citations based on the available data.

See our FAQ for additional information.