|International Conference and Workshop on Communication, Computing and Virtualization|
|Foundation of Computer Science USA|
|ICWCCV2015 - Number 2|
|Authors: Pamli Basak, Rashmi Thakur|
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.
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.