See this document in CiteSeerX!

Sampling Large Databases for Association Rules (1996)  (Make Corrections)  (189 citations)
Hannu Toivonen
In Proc. 1996 Int. Conf. Very Large Data Bases



  Home/Search   Context   Related

 
View or download:
informatik.unitrier.de/~l...Article.PS
cs.helsinki.fi/research/...vldb96.ps.gz
ai.cs.unidortmund...Toivonen_96a.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  ust.hk/dblp/db/conf/...Toivonen96 (more)
From:  ai.cs.unidortm...datawarehouse98
Homepages:  H.Toivonen  

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Discovery of association rules is an important database mining problem. Current algorithms for finding association rules require several passes over the analyzed database, and obviously the role of I/O overhead is very significant for very large databases. We present new algorithms that reduce the database activity considerably. The idea is to pick a random sample, to find using this sample all association rules that probably hold in the whole database, and then to verify the results with the... (Update)

Cited by:   More
Estimating Joint Probabilities without - Combinatory Counting April   (Correct)
Using Context to Assist in Personal File Retrieval - Soules (2006)   (Correct)
Finding the Most Interesting Patterns in a Database Quickly.. - Scheffer, Wrobel (2002)   (Correct)

Similar documents (at the sentence level):
22.5%:   Discovery of Frequent Patterns in Large Data Collections - Toivonen (1996)   (Correct)

Active bibliography (related documents):   More   All
0.0:   Integrating KDD algorithms and RDBMS code - Fernandez-Baizán, Ruiz..   (Correct)
0.0:   Integrating RDMS and Data Mining capabilities using Rough .. - Fernandez-Baizán, Ruiz..   (Correct)
0.0:   On the Use of Constrained Associations for Web Log Mining - Yang, Parthasarathy, Reddy (2002)   (Correct)

Similar documents based on text:   More   All
0.2:   Discovery of Frequent Word Sequences in Text - Ahonen-Myka   (Correct)
0.1:   Discovering Generalized Episodes Using Minimal Occurrences - Mannila, Toivonen (1996)   (Correct)
0.1:   Efficient Discovery of Functional and Approximate.. - Huhtala.. (1997)   (Correct)

Related documents from co-citation:   More   All
73:   Mining association rules between sets of items in large databases - Agrawal, Imielinski et al. - 1993
49:   Fast Algorithms for Mining Association Rules - Agrawal, Srikant - 1994
43:   An efficient algorithm for mining association rules in large databases (context) - Savasere, Omiecinski et al. - 1995

BibTeX entry:   (Update)

H. Toivonen. Sampling large databases for association rules. In 22nd VLDB Conference, 1996. http://citeseer.ist.psu.edu/toivonen96sampling.html   More

@inproceedings{ toivonen96sampling,
    author = "Hannu Toivonen",
    title = "Sampling Large Databases for Association Rules",
    booktitle = "In Proc. 1996 Int. Conf. Very Large Data Bases",
    month = "09",
    publisher = "Morgan Kaufman",
    editor = "T. M. Vijayaraman and Alejandro P. Buchmann and C. Mohan, and Nandlal L. Sarda",
%    isbn = "",
    pages = "134-145",
    year = "1996",
    url = "citeseer.ist.psu.edu/toivonen96sampling.html",
    url = "citeseer.nj.nec.com/toivonen96sampling.html" }
Citations (may not include all citations):
921   Mining association rules between sets of items in large data.. - Agrawal, Imielinski et al.



The graph only includes citing articles where the year of publication is known.


Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC