Parallel batch self-organizing map on graphics processing unit using CUDA

• Main Authors: Daneshpajouh, H., Delisle, P., Boisson, J.-C., Krajecki, M., Zakaria, N.
• Format: Article
• Published: Springer Verlag 2018
• Online Access: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85040232044&doi=10.1007%2f978-3-319-73353-1_6&partnerID=40&md5=855c79f6bc9bbf3e845fb2ec81210fdc; http://eprints.utp.edu.my/21323/

Batch Self-Organizing Map (Batch-SOM) is being successfully used for clustering and visualization of high-dimensional datasets in a wide variety of domains. Although the structure of its training algorithm has a high potential for parallelization, focus of the previous efforts has been on the original Step-wise SOM. This gap is due to the facts that Batch-SOM requires some extra precautions (specially in its initialization phase), and it took quite a while since its introduction that researchers affirmed the desirability of using it in practice over the Step-wise SOM. Hence, the purpose of this paper is to propose a GPU parallelization model and implementation for the Batch-SOM using CUDA. The most computationally expensive parts of its training algorithm (such as steps to compute distance between each data vector and neuron, and determining the Best Matching Unit based on minimum distance) are identified and mapped on GPU to be processed in parallel. The proposed implementation shown significant speedups of 11� and 5� compared to the sequential and parallel CPU implementations respectively. © Springer International Publishing AG 2018.