Issue No. 06 - December (1996 vol. 8)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.553164
<p><b>Abstract</b>—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.</p>
Data mining, association rules, parallel algorithms.
R. Agrawal and J. C. Shafer, "Parallel Mining of Association Rules," in IEEE Transactions on Knowledge & Data Engineering, vol. 8, no. , pp. 962-969, 1996.