DocumentCode
684840
Title
A GPU-based Harmony K-means Algorithm for document clustering
Author
Zhanchun Gao ; Enxing Li ; Yanjun Jiang
fYear
2012
fDate
7-9 Dec. 2012
Firstpage
1
Lastpage
4
Abstract
Document clustering is one of the most important tasks in text mining. In clustering algorithms, high-dimensional vector is usually used to represent a document which causes that the algorithms are often computationally expensive. On the other hand, Graphic Processing Unit (GPU) is increasingly important in parallel computing due to its powerful parallel capacity and high bandwidth. This paper implements a GPU-based Harmony K-means Algorithm (HKA) with NVIDIA´s Compute Unified Device Architecture (CUDA), and uses it for document clustering. In our experiment, our GPU-based program can acquire a maximum 20 times speedup in contrast with CPU-based program.
Keywords
data mining; document handling; graphics processing units; parallel architectures; parallel programming; pattern clustering; vectors; CUDA; GPU; HKA; compute unified device architecture; document clustering; graphic processing unit; harmony k-means algorithm; high-dimensional vector; parallel computing; text mining; GPU; Harmony search; K-means; document clustering; parallel computing;
fLanguage
English
Publisher
iet
Conference_Titel
Information Science and Control Engineering 2012 (ICISCE 2012), IET International Conference on
Conference_Location
Shenzhen
Electronic_ISBN
978-1-84919-641-3
Type
conf
DOI
10.1049/cp.2012.2426
Filename
6755805
Link To Document