Skip to main content
SpringerLink
Log in

Communication-Efficient Distributed Mining of Association Rules

  • Published:
Data Mining and Knowledge Discovery Aims and scope Submit manuscript

Abstract

Mining for associations between items in large transactional databases is a central problem in the field of knowledge discovery. When the database is partitioned among several share-nothing machines, the problem can be addressed using distributed data mining algorithms. One such algorithm, called CD, was proposed by Agrawal and Shafer and was later enhanced by the FDM algorithm of Cheung, Han et al. The main problem with these algorithms is that they do not scale well with the number of partitions. They are thus impractical for use in modern distributed environments such as peer-to-peer systems, in which hundreds or thousands of computers may interact.

In this paper we present a set of new algorithms that solve the Distributed Association Rule Mining problem using far less communication. In addition to being very efficient, the new algorithms are also extremely robust. Unlike existing algorithms, they continue to be efficient even when the data is skewed or the partition sizes are imbalanced. We present both experimental and theoretical results concerning the behavior of these algorithms and explain how they can be implemented in different settings.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Agrawal, R. and Shafer, J. 1996.Parallel mining of association rules. IEEE Transactions on Knowledge and Data Engineering, 8(6):962–969.

    Google Scholar 

  • Agrawal, R. and Srikant, R. 1994. Fast algorithms for mining association rules. In Proc. of the 20th Int'l. Conference on Very Large Databases (VLDB'94). Santiago, Chile, pp. 487–499.

  • Bayardo, R. and Agrawal, R. 1999. Mining the most interesting rules. In Proc. of the ACM SIGKDD Conf. on Knowledge Discovery and Data Mining. San Diego, California, pp. 145–154.

  • Brin, S., Motwani, R., Ullman, J.D., and Tsur, S. 1997. Dynamic itemset counting and implication rules for market basket data. SIGMOD Record, 6(2):255–264.

    Google Scholar 

  • Cheung, D. and Xiao, Y. 1998.Effect of data skewness in parallel mining of association rules.In 12th Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 48–60.

  • Cheung, D.W., Han, J., Ng, V., Fu, A., and Fu, Y. 1996. A fast distributed algorithm for mining association rules. In Proc. of 1996 Int'l. Conf. on Parallel and Distributed Information Systems. Miami Beach, Florida, pp. 31–44.

  • Eui-Hong (Sam) Han, Karypis, G., and Kumar, V. 2000. Scalable parallel data mining for association rules. IEEE Transactions on Knowledge and Data Engineering, 12(3):352–377.

    Google Scholar 

  • Han, J., Pei, J., and Yin, Y. 1999. Mining frequent patterns without candidate generation. Technical Report 99–12, Simon Fraser University.

  • Han, J. and Fu, Y. 1995. Discovery of multiple-level association rules from large databases. In Proc. of the 21st Int'l. Conference on Very Large Data Bases (VLDB'95). Zurich, Switzerland, pp. 420–431.

  • Jarai, Z., Virmani, A., and Iftode, L. 1998. Towards a cost-effective parallel data mining approach. Workshop on High Performance Data Mining (held in conjunction with IPPS'98).

  • Park, J.S., Chen, M.-S., and Yu, P.S. 1995. An effective hash-based algorithm for mining association rules. In Proc. of ACM SIGMOD Int'l. Conference on Management of Data. San Jose, California, pp. 175–186.

  • Schuster, A. and Wolff, R. 2001. Communication-efficient distributed mining of association rules. In Proc. of the 2001 ACM SIGMOD Int'l. Conference on Management of Data. Santa Barbara, California, pp. 473–484.

  • Srikant, R. Synthetic data generation code for association and sequential patterns. Available from the I.B.M. Quest Web site at http://www.almaden.ibm.com/cs/quest/.

  • Srikant, R. and Agrawal, R. 1994. Mining generalized association rules. In Proc. of the 20th Int'l. Conference on Very Large Databases (VLDB'94). Santiago, Chile, pp. 407–419.

  • Toivonen, H. 1996. Sampling large databases for association rules. The VLDB Journal, 134–145.

  • Zaki, M.J., Ogihara, M., Parthasarathy, S., and Li, W. 1996. Parallel data mining for association rules on sharedmemory multi-processors. In Proc. of Supercomputing'96. Pittsburg, PA, pp. 17–22.

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Technion, Israel Institute of Technology, Technion City, Haifa, 32000, Israel

    Assaf Schuster & Ran Wolff

Authors
  1. Assaf Schuster
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ran Wolff
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schuster, A., Wolff, R. Communication-Efficient Distributed Mining of Association Rules. Data Mining and Knowledge Discovery 8, 171–196 (2004). https://doi.org/10.1023/B:DAMI.0000015870.80026.6a

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:DAMI.0000015870.80026.6a

Search

Navigation