Sampling Large Databases for Association Rules

  title={Sampling Large Databases for Association Rules},
  author={Hannu Toivonen},
Discovery of association rules is an important database mining problem. Current algorithms for nding association rules require several passes over the analyzed database, and obviously the role of I/O overhead is very signi cant for very large databases. We present new algorithms that reduce the database activity considerably. The idea is to pick a random sample, to nd using this sample all association rules that probably hold in the whole database, and then to verify the results with the rest… CONTINUE READING
Highly Influential
This paper has highly influenced 61 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 1,313 citations. REVIEW CITATIONS


Publications citing this paper.

1,314 Citations

Citations per Year
Semantic Scholar estimates that this publication has 1,314 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 11 references

An e  cient algorithm for mining association rules in large databases

  • Ashok Savasere
  • Proceedings of the 21 st International Conference…
  • 1995

Swami . Sequential sampling procedures for query size estimation

  • Marcel Holsheimer, Martin Kersten, Peter J. Haas, N. Arun
  • 1995

E  cient algorithms for discovering association rules

  • Frank Olken, Doron Rotem
  • Knowledge Discovery in Databases , Papers from…
  • 1994

Setoriented mining of association rules

  • Maurice Houtsma, Arun Swami
  • Research Report RJ 9567,
  • 1993

The power of sampling in knowledge discov

  • Mika Klemettinen, Heikki Mannila
  • 1993

Similar Papers

Loading similar papers…