This Article 
 Bibliographic References 
 Add to: 
Parallel Mining of Association Rules
December 1996 (vol. 8 no. 6)
pp. 962-969

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.

[1] R. Agrawal, T. Imielinski, and A. Swami, “Mining Association Rules Between Sets of Items in Large Databases,” Proc. 1993 ACM-SIGMOD Int'l Conf. Management of Data, pp. 207-216, May 1993.
[2] R. Agrawal and J. Shafer, "Parallel Mining of Association Rules: Design, Implementation, and Experience," Research Report RJ 10004, IBM Almaden Research Center, San Jose, Calif., Feb. 1996. Available from
[3] R. Agrawal and R. Srikant, “Fast Algorithms for Mining Association Rules,” Proc. 1994 Int'l Conf. Very Large Data Bases, pp. 487-499, Sept. 1994.
[4] "MPI: A Message-Passing Interface Standard," Message Passing Interface Forum, May 1994.
[5] J. Han and Y. Fu, “Discovery of Multiple-Level Association Rules from Large Databases,” Proc. 1995 Int'l Conf. Very Large Data Bases, pp. 420-431, Sept. 1995.
[6] M. Houtsma and A. Swami, "Set-Oriented Mining of Association Rules," Proc. Int'l Conf. Data Engineering,Taipei, Taiwan, Mar. 1995.
[7] Scalable POWERparallel Systems, Int'l Business Machines, GA23-2475-02 edition, Feb. 1995.
[8] H. Mannila, H. Toivonen, and A.I. Verkamo, "Efficient Algorithms for Discovering Association Rules," Proc. KDD '94: AAAI Workshop Knowledge Discovery in Databases, pp. 181-192,Seattle, July 1994.
[9] J.S. Park, M.S. Chen, and P.S. Yu, “An Effective Hash-Based Algorithm for Mining Association Rules,” Proc. 1995 ACM-SIGMOD Int'l Conf. Management of Data, pp. 175-186, May 1995.
[10] J. Park, M. Chen, and P. Yu, Efficient Parallel Data Mining for Association Rules Proc. Fourth Int'l Conf. Information and Knowledge Management, pp. 31-36, 1995.
[11] A. Savasere, E. Omiecinski, and S. Navathe, “An Efficient Algorithm for Mining Association Rules in Large Databases,” Proc. 1995 Int'l Conf. Very Large Data Bases, pp. 432-443, Sept. 1995.
[12] R. Srikant and R. Agrawal, “Mining Generalized Association Rules,” Proc. 1995 Int'l Conf. Very Large Data Bases, pp. 407-419, Sept. 1995.

Index Terms:
Data mining, association rules, parallel algorithms.
Rakesh Agrawal, John C. Shafer, "Parallel Mining of Association Rules," IEEE Transactions on Knowledge and Data Engineering, vol. 8, no. 6, pp. 962-969, Dec. 1996, doi:10.1109/69.553164
Usage of this product signifies your acceptance of the Terms of Use.