Advertisement

Effect of data skewness in parallel mining of association rules

  • David W. Cheung
  • Yongqiao Xiao
Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1394)

Abstract

An efficient parallel algorithm FPM(Fast Parallel Mining) for mining association rules on a shared-nothing parallel system has been proposed. It adopts the count distribution approach and has incorporated two powerful candidate pruning techniques, i.e., distributed pruning and global pruning. It has a simple communication scheme which performs only one round of message exchange in each iteration. We found that the two pruning techniques are very sensitive to data skewness, which describes the degree of non-uniformity of the itemset distribution among the database partitions. Distributed pruning is very effective when data skewness is high. Global pruning is more effective than distributed pruning even for the mild data skewness case. We have implemented the algorithm on an IBM SP2 parallel machine. The performance studies confirm our observation on the relationship between the effectiveness of the two pruning techniques and data skewness. It has also shown that FPM outperforms CD (Count Distribution) consistently, which is a parallel version of the popular Apriori algorithm [2, 3]. Furthermore, FPM has nice parallelism of speedup, scaleup and sizeup.

Keywords

Association Rules Data Mining Data Skewness Parallel Computing 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. of 1993 ACM-SIGMOD Int. Conf. On Management of Data, Washington, D.C., 1993.Google Scholar
  2. 2.
    R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. of the 20th VLDB Conference, Santiago, Chile, 1994.Google Scholar
  3. 3.
    R. Agrawal and J.C. Shafer. Parallel mining of association rules: Design, implementation and experience. Special Issue in Data Mining, IEEE Trans. on Knowledge and Data Engineering, IEEE Computer Society, V8, N6, December 1996, pp. 962–969.CrossRefGoogle Scholar
  4. 4.
    S. Brin, R. Motwani, J. Ullman, S. Tsur. Dynamic itemset counting and implication rules for market basket data. In Proc. of 1997 ACM-SIGMOD Int. Conf. On Management of Data, pages 255–264, Tucson, Arizona, 1997.Google Scholar
  5. 5.
    T. M. Cover, T. A. Thomas. Elements of information theory. John Wiley & Sons, Inc., 1991.Google Scholar
  6. 6.
    D. W. Cheung, J. Han, V. Ng and C. Y. Wong. Maintenance of discovered association rules in large databases: An incremental updating technique. In Proc. of the 12th Int. Conf. on Data Eng., New Orleans, Louisiana, 1996.Google Scholar
  7. 7.
    D. W. Cheung, J. Han, V. T. Ng, A. W. Fu, Y. Fu. A fast distributed algorithm for mining association rules. In Proc. of 4th Int. Conf. on Parallel and Distributed Information Systems, pages 31–43, Miami Beach, Florida, December, 1996.Google Scholar
  8. 8.
    E. Han, G. Karypis and V. Kumar. Scalable parallel data mining for association rules. In Proc. of 1997 ACM-SIGMOD Int. Conf. On Management of Data, pages 277–288, Tucson, Arizona, 1997.Google Scholar
  9. 9.
    J Han and Y Fu. Discovery of multiple-level association rules from large databases. In Proc. of the 21th VLDB Conference, Zurich, Switzerland, 1995.Google Scholar
  10. 10.
    Message Passing Interface Forum. MPI: A Message-Passing Interface Standard, May 1994.Google Scholar
  11. 11.
    J. S. Park, M. S. Chen, and P. S. Yu, An effective hash-based algorithm for mining association rules. In Proc. of 1995 ACM-SIGMOD Int. Conf. on Management of Data, pages 175–186, San Jose, CA, May 1995.Google Scholar
  12. 12.
    J. S. Park, M. S. Chen, and P. S. Yu, Efficient parallel mining for association rules. In Proc. of the 4th Int. Conf. on Information and Knowledge Management, Baltimore, Maryland, 1995.Google Scholar
  13. 13.
    A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. In Proc. of the 21th VLDB Conference, Zurich, Switzerland, 1995.Google Scholar
  14. 14.
    R. Srikant and R. Agrawal. Mining quantitative association rules in large relational tables. In Proc. 1996 ACM-SIGMOD Int. Conf. on Management of Data, Montreal, Canada, 1996.Google Scholar
  15. 15.
    T. Shintani, M. Kitsuregawa. Hash based parallel algorithms for mining association rules. In Proc. of 4th Int. Conf. on Parallel and Distributed Information Systems, Miami Beach, Florida, 1996.Google Scholar
  16. 16.
    M. J. Zaki, M. Ogihara, S. Parthasarathy, and W. Li, Parallel data mining for association rules on shared-memory multi-processors. Supercomputing'96, Pittsburg, PA, Nov 17–22, 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • David W. Cheung
    • 1
  • Yongqiao Xiao
    • 1
  1. 1.Department of Computer ScienceThe University of Hong KongHong Kong

Personalised recommendations