Skip to main content
Log in

A fast distributed algorithm for association rule mining based on binary coding mapping relation

  • Web Information Mining and Retrieval
  • Published:
Wuhan University Journal of Natural Sciences

Abstract

Association rule mining is an important issue in data mining. The paper proposed an binary system based method to generate candidate frequent itemsets and corresponding supporting counts efficiently, which needs only some operations such as “and”, “or” and “xor”. Applying this idea in the existed distributed association rule mining algorithm FDM, the improved algorithm BFDM is proposed. The theoretical analysis and experiment testify that BFDM is effective and efficient.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Agrawal R, Imielinski T, Swami A. Mining Association Rules Between Sets of Items in Large Databases.Proc ACM SIGMOD Int Conf Management of Date. Washington D C, 1993. 207–216.

  2. Han J, Kamber M.Data Mining: Concepts and Techniques. Beijing: High Education Press, 2001.

    Google Scholar 

  3. Goethals B. Survey on Frequent Pattern Mining.Helsinki Institute for Information Technology. Technical Report, 2003.

  4. Park J S, Chen M S, Yu P S. Efficient Parallel Data Mining for Association Rules.Proceedings of the 4th International Conference on Information and Knowledge Management, Baltimore Maryland, 1995. 31–36.

  5. Agrawal R, Shafer J C. Parallel Mining of Association Rules.IEEE Transactions on Knowledge and Data Engineering, 1996,8(6):962–969.

    Article  Google Scholar 

  6. Cheung D W, Han J W, Ng V T,et al. A Fast Distributed Algorithm for Mining Association Rules.Proceedings of IEEE 4th International Conference Parallel and Distributed Information Systems. Miami Beach, Florida, 1996. 31–44.

  7. Cheung D W, Ng V T, Fu A W. Efficient Mining of Association Rules in Distributed Databases.IEEE Transactions on Knowledge and Data Engineering, 1996,8(6):911–922.

    Article  Google Scholar 

  8. Cheung D W, Lee S D, Xiao Y Q. Effect of Data Skewness and Workload Balance in Parallel Data Mining.IEEE Transactions on Knowledge and Data Engineering, 2002,14(3): 498–514.

    Article  Google Scholar 

  9. Schuster A, Wolff R. Communication Efficient Distributed Mining of Association Rules.Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data, Santa Barbara, California, 2001. 473–484.

  10. Zaki M J. Scalable Algorithms for Association Mining.IEEE Transactions on Knowledge and Data Engineering, 2000,12(3):372–390.

    Article  MathSciNet  Google Scholar 

  11. Han Eui-hong, Karypis G, Kumar V. Scalable Parallel Data Mining for Association Rules.IEEE Transactions on Knowledge and Data Engineering, 2000,12(3):337–352.

    Article  Google Scholar 

  12. Iko P M, Kitsuregawa M. Parallel FP-Growth on PC Cluster.Proceedings of Seventh Pacific-Asia Conference of Knowledge Discovery and Data Mining (PAKDD 2003). Tokyo, 2003. 467–473.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sun Zhi-hui.

Additional information

Foundation item: Supported by the National Natural Science Foundation of China (70371015)

Biography: CHEN Geng (1965-), male, Ph. D. candidate, research direction: data mining and knowledge discovery.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Geng, C., Wei-wei, N., Yu-quan, Z. et al. A fast distributed algorithm for association rule mining based on binary coding mapping relation. Wuhan Univ. J. Nat. Sci. 11, 27–30 (2006). https://doi.org/10.1007/BF02831698

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02831698

Key words

CLC number

Navigation