The week's pick
Reseach Article
An Efficient Approach for Parallel and Incremental Mining of Frequent Pattern in Transactional Database
| International Conference and Workshop on Communication, Computing and Virtualization |
| Foundation of Computer Science USA |
| ICWCCV2015 - Number 2 |
| September 2015 |
| Authors: Pamli Basak, Rashmi Thakur |
| bacccd80-e4d8-4770-9e92-853cf1ea4c8e |
Pamli Basak, Rashmi Thakur . An Efficient Approach for Parallel and Incremental Mining of Frequent Pattern in Transactional Database. International Conference and Workshop on Communication, Computing and Virtualization. ICWCCV2015, 2 (September 2015), 0-0.
Abstract
In this paper, we provide an overview of parallel incremental association rule mining, which is one of the imminent ideas in the new and rapidly emerging research area of data mining. A useful tool for discovering frequently co-occurrent items is frequent itemset mining (FIM). Since its commencement, a number of significant FIM algorithms have been build up to increase mining performance. But when thedataset size is huge, both the computational cost and memory use can be toocostly. In this paper,we put frontward parallelizing the FP-Growth algorithm. We use MapReduce to execute the parallelization of FP-Growth algorithm. Henceforth, it splits the mining task into number of sub-tasks, implements these sub-tasks in parallel on nodes and then combines the results back for the final result. Experiments show that the result increases the computational speed as compared to apriori and fp-growth.
References
- Jaiwei Han and Micheline Kamber, Data Mining, Concepts and Techniques: An imprint of Elsevier, Second Edition, 2006.
- R. Agrawal and R. Srikant, "Fast algorithms for mining association rules," in Int. Conf. VLDB, pages 487-499, September 1994.
- Jaiwei Han, Jian Pei and Yiwen Yin- "Mining Frequent Patterns without Candidate Generation," in Int. Conf. ACM-SIGMOID. pages 1-12, June 2000.
- H. Li, Y. Wang, D. Zhang, M. Zhang and E. Chang, PFP: Parallel FP-Growth for Query Recommendation, Proceedings of the 2008 ACM Conference on Recommender Systems, 2008, pages 107-114.
- A. Pradeepa, and A. S. Thanamani, PARALLELIZED COMPRISING FOR APRIORI ALGORITHM USING MAPREDUCE FRAMEWORK, International Journal of Advanced Research in Computer and Communication Engineering, vol. 2(11), 2013, pp. 4365-4368.
- J. Dean and S. Ghemawat, -MapReduce: simplified data processing on large clusters, Communications of the ACM, vol. 51, Jan. 2008, pp. 107–113.
- D. W. Cheung, J. Han, V. T. Ng, and C. Y. Wong, "Maintence of discovered association rules in large databases:an incremental updating technique. " in Int. Conf. on Data Engineering, pages 106-114, February 1996.
- T. F. Garib, M. Taha, and H. Nassar, "An efficient technique for incremental updating of association rules. " International Journal of hybrid Intelligent Systems, pages 45-53, May 2008.
- An Hongmei, Chen Ping- "Study of Incremental Updating Algorithm for Association Rules"- Atlantis Press, Paris, France,2012.
- Li Sun, Yuchen Cai, Jiyun Li, Juntao Lv- "An Efficient Algorithm for updating Association Rules with Incremental Transactions and Minimum support Changes Simultaneously"- IEEE Third Global Congress on Intelligent Systems, 2012.
- X. Wei, Y. Ma, F. Zhang, M. Liu, W. Shen, Incremental FP-Growth Mining Strategy for Dynamic Threshold value and Database Based on Mapreduce, Proceedings of the 2014 IEEE 18th International Conference on Computer Supported Cooperative Work in Design, May 2014, pages 271-276.
- S. Kurazumi, T. Tsumura, S. Saito, and H. Matsuo, Dynamic processing slots scheduling for I/O intensive jobs of Hadoop MapReduce, Proceedings of the 2012 3rd International Conference on Networking and Computing, 2012, pp. 288-292.
Index Terms
Keywords