TY - JOUR EP - 100 PB - Springer Verlag SN - 18650929 TI - Parallel batch self-organizing map on graphics processing unit using CUDA SP - 87 N1 - cited By 1; Conference of 4th Latin American Conference on High Performance Computing, CARLA 2017 ; Conference Date: 20 September 2017 Through 22 September 2017; Conference Code:209259 AV - none VL - 796 JF - Communications in Computer and Information Science A1 - Daneshpajouh, H. A1 - Delisle, P. A1 - Boisson, J.-C. A1 - Krajecki, M. A1 - Zakaria, N. UR - 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 Y1 - 2018/// ID - scholars10919 KW - Computer graphics; Computer graphics equipment; Conformal mapping; Program processors; Self organizing maps KW - Best matching units; Clustering; CUDA; GPGPU; Gpu parallelization; High dimensional datasets; Parallel SOM; Training algorithms KW - Graphics processing unit N2 - 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. ER -