A GPU-based harmony K-means algorithm for document clustering

3Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

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 GPUbased 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.

Cite

CITATION STYLE

APA

Gao, Z., Li, E., & Jiang, Y. (2012). A GPU-based harmony K-means algorithm for document clustering. In IET Conference Publications (Vol. 2012). https://doi.org/10.1049/cp.2012.2426

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free