(Enter summary)
Abstract: We consider the problem of mining association rules on a shared-nothing multiprocessor. We present three algorithms that explore a spectrum of trade-offs between computation, communication, memory usage, synchronization, and the use of problem-specific information. The best algorithm exhibits near perfect scaleup behavior, yet requires only minimal overhead compared to the current best serial algorithm. (Update)
Cited by: More
Parallel Mining for Frequent Fragments on a.. - Meinl, Fischer.. (2005)
(Correct)
Dynamic Data Mining - Raghavan, Hafez
(Correct)
A Theoretical Framework for Association Mining based .. - Bollmann-Sdorra..
(Correct)
Active bibliography (related documents): More All
0.3: Effect of Data Skewness and Workload Balance in Parallel Data .. - Cheung, Lee, Xiao
(Correct)
0.3: SPRINT: A Scalable Parallel Classifier for Data Mining - Shafer, Agrawal, Mehta (1996)
(Correct)
0.1: Extended Concepts for Association Rule Discovery - Rantzau (1997)
(Correct)
Similar documents based on text: More All
0.3: A Framework for Efficient Scalable Mining of Rule Variants - Ong, Ng, Lim (2001)
(Correct)
0.3: Fast Algorithms for Mining Association Rules - Agreewed, Srikent
(Correct)
0.1: A Data-Clustering Algorithm On Distributed Memory Multiprocessors - Dhillon, Modha
(Correct)
Related documents from co-citation: More All
29: Fast Algorithms for Mining Association Rules
- Agrawal, Srikant - 1994
27: Scalable parallel data mining for association rules
- Han, Karypis et al. - 1997
25: Mining association rules between sets of items in large databases
- Agrawal, Imielinski et al. - 1993
BibTeX entry: (Update)
Agrawal, R., and Shafer, J. 1996. Parallel mining of association rules. IEEE Transactions on Knowledge and Data Engineering 8(6). http://citeseer.ist.psu.edu/agrawal96parallel.html More
@article{ agrawal96parallel,
author = "R. Agrawal and J. C. Shafer",
title = "Parallel mining of association rules",
journal = "Ieee Trans. On Knowledge And Data Engineering",
volume = "8",
address = "Ibm Corp, Almaden Res Ctr, 650 Harry Rd, San Jose, Ca, 95120",
pages = "962--969",
year = "1996",
url = "citeseer.ist.psu.edu/agrawal96parallel.html" }
Citations (may not include all citations):
921
Mining association rules between sets of items in large data..
- Agrawal, Imielinski et al. - 1993 ACM DBLP
912
MPI: A Message-Passing Interface Standard
- Interface - 1994 ACM
910
Fast Algorithms for Mining Association Rules
- Agrawal, Srikant - 1994 ACM
268
Mining Generalized Association Rules
- Srikant, Agrawal - 1995 ACM DBLP
213
Discovery of multiple-level association rules from large dat..
- Han, Fu - 1995 ACM DBLP
164
An efficient algorithm for mining association rules in large.. (context) - Savasere, Omiecinski et al. - 1995 ACM DBLP
121
Efficient algorithms for discovering association rules
- Mannila, Toivonen et al. - 1994 DBLP
48
Parallel mining of association rules: Design (context) - Agrawal, Shafer - 1996
47
Set-oriented mining of association rules (context) - Houtsma, Swami - 1995
35
An effective hash based algorithm for mining association rul.. (context) - Park, Chen et al. - 1995 DBLP
34
Efficient parallel data mining for association rules (context) - Park, Chen et al. - 1995 ACM
3
Scalable POWERparallel Systems (context) - Machines - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://barbera.cnuce.cnr.it/~palmeri/datam/articles.html): More
CACTUS - Clustering Categorical Data Using Summaries - Ganti, Gehrke, Ramakrishnan (1999)
(Correct)
Mining Very Large Databases - Ganti, Gehrke, Ramakrishnan (1999)
(Correct)
Automatic Subspace Clustering of High Dimensional.. - Agrawal, Gehrke.. (1998)
(Correct)
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