DocumentCode
2054369
Title
GPApriori: GPU-Accelerated Frequent Itemset Mining
Author
Zhang, Fan ; Zhang, Yan ; Bakos, Jason
Author_Institution
Dept. of Comput. Sci., Univ. of South Carolina, Columbia, SC, USA
fYear
2011
fDate
26-30 Sept. 2011
Firstpage
590
Lastpage
594
Abstract
In this paper we describe GPA priori, a GPU-accelerated implementation of Frequent Item set Mining (FIM). We tested our implementation with an Nvidia Tesla T10 graphic processor and demonstrate up to 100× speedup as compared with several state-of-the-art FIM algorithms on a CPU. In order to map the Apriori algorithm onto the SIMD execution model, we have designed a "static bitset" memory structure to represent the input database. This data structure improves upon the traditional approach of the vertical data layout in state-of-the art Apriori implementations. In our implementation, we perform a parallelized version of the support counting step on the GPU. Experimental results show that GPA priori consistently outperforms CPU-based Apriori implementations. Our results demonstrate the potential for GPGPUs in speeding up data mining algorithms.
Keywords
coprocessors; data mining; parallel processing; FIM; GPApriori; GPU-accelerated frequent itemset mining; Nvidia Tesla T10 graphic processor; SIMD execution model; data mining; data structure; static bitset memory structure; Accidents; Clustering algorithms; Data mining; Data structures; Graphics processing unit; Instruction sets; Itemsets; Association rule mining; CUDA GPU computing; Frequent itemset mining; Parallel Computing;
fLanguage
English
Publisher
ieee
Conference_Titel
Cluster Computing (CLUSTER), 2011 IEEE International Conference on
Conference_Location
Austin, TX
Print_ISBN
978-1-4577-1355-2
Electronic_ISBN
978-0-7695-4516-5
Type
conf
DOI
10.1109/CLUSTER.2011.61
Filename
6061214
Link To Document