A haoop-based parallel mining of frequent itemsets using N-Lists. (3rd April 2018)

• Record Type: Journal Article
• Authors: Sohrabi, Mohammad Karim; Taheri, Narjes
• Is Part Of: Journal of the Chinese Institute of Engineers. Volume 41:Number 3(2018)
• Page Start: 229
• Page End: 238
• Publication Date: 2018-04-03
• Subjects: Data mining -- frequent itemset mining -- hadoop -- parallelization; Technology -- Periodicals; Engineering -- Periodicals; 620.005
• DOI: 10.1080/02533839.2018.1454853
• Languages: English
• ISSNs: 0253-3839

Abstract

Abstract: Frequent pattern mining is the most important phase of association rule mining process because of its time and space complexity. Several methods have attempted to improve the performance of association rule mining by enhancing frequent pattern mining efficiency. Due to the large size of the data-sets and huge amounts of data which should be mined, many parallel and distributed mining approaches have been introduced to divide data-sets or to distribute mining processes between multiple processors or computers and thus, improve the efficiency of the mining process. In this paper, we propose a hadoop-based parallel implementation of PrePost+ algorithm for frequent itemset mining. In our parallel approach, the process of constructing N-Lists of itemsets has been distributed between the mappers and the operation of the final pruning process and extracting frequent itemsets has been carried out by reducers in a map-reduce parallel programming model. The experimental results show that our hadoop-based PrePost+(HBPrePost+) algorithm outperforms one of the best existing parallel methods of frequent itemset mining (PARMA) in terms of execution time.