Accelerating Parallel Frequent Itemset Mining on Graphics Processors with Sorting - Network and Parallel Computing Access content directly
Conference Papers Year : 2013

Accelerating Parallel Frequent Itemset Mining on Graphics Processors with Sorting

Abstract

Frequent Itemset Mining (FIM) is one of the most investigated fields of data mining. The goal of Frequent Itemset Mining (FIM) is to find the most frequently-occurring subsets from the transactions within a database. Many methods have been proposed to solve this problem, and the Apriori algorithm is one of the best known methods for frequent Itemset mining (FIM) in a transactional database. In this paper, a parallel Frequent Itemset Mining Algorithm, called Accelerating Parallel Frequent Itemset Mining on Graphic Processors with Sorting (APFMS), is presented. This algorithm utilizes new-generation graphic processing units (GPUs) to accelerate the mining process. In it, massive processing units of GPU were used to speed up the frequent item verification procedure on the OpenCL platform. The experimental results demonstrated that the proposed algorithm had dramatically reduced computation time compared with previous methods.
Fichier principal
Vignette du fichier
978-3-642-40820-5_21_Chapter.pdf (670.94 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01513752 , version 1 (25-04-2017)

Licence

Attribution

Identifiers

Cite

Yuan-Shao Huang, Kun-Ming Yu, Li-Wei Zhou, Ching-Hsien Hsu, Sheng-Hui Liu. Accelerating Parallel Frequent Itemset Mining on Graphics Processors with Sorting. 10th International Conference on Network and Parallel Computing (NPC), Sep 2013, Guiyang, China. pp.245-256, ⟨10.1007/978-3-642-40820-5_21⟩. ⟨hal-01513752⟩
40 View
127 Download

Altmetric

Share

Gmail Facebook X LinkedIn More