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.
Similar content being viewed by others
References
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.
Han J, Kamber M.Data Mining: Concepts and Techniques. Beijing: High Education Press, 2001.
Goethals B. Survey on Frequent Pattern Mining.Helsinki Institute for Information Technology. Technical Report, 2003.
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.
Agrawal R, Shafer J C. Parallel Mining of Association Rules.IEEE Transactions on Knowledge and Data Engineering, 1996,8(6):962–969.
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.
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.
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.
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.
Zaki M J. Scalable Algorithms for Association Mining.IEEE Transactions on Knowledge and Data Engineering, 2000,12(3):372–390.
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.
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.
Author information
Authors and Affiliations
Corresponding author
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
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
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02831698