A Parallel Implementation of the Gustafson-Kessel Clustering Algorithm with CUDA
Jeong Bong SEO, Dae‐Won Kim · IEICE Transactions on Information and Systems · 2012
Despite the benefits of the Gustafson-Kessel (GK) clustering algorithm, it becomes computationally inefficient when applied to high-dimensional data. In this letter, a parallel implementation of the GK algorithm on the GPU with CUDA is proposed. Using an optimized matrix multiplication algorithm with fast access to shared memory, the CUDA version achieved a maximum 240-fold speedup over the single-CPU version.