Parallel Implementation of Apriori Algorithm Based on MapReduce
2012pp. 236–241
Citations Over TimeTop 1% of 2012 papers
Abstract
Searching frequent patterns in transactional databases is considered as one of the most important data mining problems and Apriori is one of the typical algorithms for this task. Developing fast and efficient algorithms that can handle large volumes of data becomes a challenging task due to the large databases. In this paper, we implement a parallel Apriori algorithm based on MapReduce, which is a framework for processing huge datasets on certain kinds of distributable problems using a large number of computers (nodes). The experimental results demonstrate that the proposed algorithm can scale well and efficiently process large datasets on commodity hardware.
Related Papers
- Overview of Association Rules Apriori Mining Algorithm(2011)
- → Research of Data Mining Algorithm Based on Association Rules(2011)3 cited
- Improved apriori mining frequent items algorithm(2012)
- → Data Mining and Simulation Analysis of Aircraft Control System Based on Apriori Algorithm(2018)1 cited