PERFORMANCE ANALYSIS OF ASSOCIATION RULE MINING ALGORITHMS USING HADOOP
Article Sidebar
Main Article Content
Аннотация:
Association rule mining has been a very important method in the field of data mining. Apriori algorithm is a classical algorithm for association rule mining. In the big data environment, the traditional Apriori algorithm has been unable to meet the needs of mining. In the paper, the parallelization of the Apriori algorithm is implemented based on the Hadoop platform and the Map Reduce programming model. On the basis, the algorithm is further optimized by using the idea of transaction reduction. Experimental results show that the proposed algorithm can be better to meet the requirements of big data mining and efficiently mining frequent itemsets and association rules from large dataset.
Article Details
Как цитировать:
Библиографические ссылки:
Agrawal, R., Imielinski, T. and Swami, A. 1993. Mining Association Rules between Sets of Items in Large Databases. In ACM SIGMOD Conf. Management of Data, Washington, D.C., 207–216.
Agrawal, R. and Srikant, R. 1994. Fast Algorithms for Mining Association Rules. In Proceedings of the Twentieth International Conference on Very Large Databases, Santiago, Chile, 487–499.
Ward, J. S. and Barker, A. Undefined By Data: A Survey of Big Data Definitions. http://arxiv.org/abs/1309.5821v1. Retrieved Sept. 2015.
Apache Hadoop. http://hadoop.apache.org
Dean J. & Ghemawat S. (2004). MapReduce: Simplified Data Processing on Large Clusters. Proc. of the 6 th Symposium on Operation Systems Designing and Implementation (OSDI '04). San Francisco, CA, Google Inc.: 1- 13.
Li H., Wang Y., Zhang D., Zhang M. & Chang E.Y. (2008). PFP: Parallel FP-Growth for Query Recommendation. Proceeding of the 2008 ACM conference on Recommender systems (RecSys ’08). New York, NY, USA, ACM: 107 – 114.
He Q., Zhuang F., Li J. & Shi Z. (2010). Parallel Implementation of classification algorithms based on MapReduce. Proc. of the 5 th International Conference on Rough Set and Knowledge Technology (RSKT ’10). Berlin, Heidelberg, Springer: 655 – 662.