Enhancing Performance of Parallel Self-Organizing Map on Large Dataset with Dynamic Parallel and Hyper-Q

  • Alexander F.K. Sibero Universitas Sumatera Utara
  • Opim Salim Sitompul Universitas Sumatera Utara
  • Mahyuddin K.M. Nasution Universitas Sumatera Utara
Keywords: Dynamic Parallel, Hyper-Q, Parellel SOM, Self-Organizing Map

Abstract

Self-Organizing Map (SOM) is an unsupervised artificial neural network algorithm. Even though this algorithm is known to be an appealing clustering method,
many efforts to improve its performance are still pursued in various research works. In order to gain faster computation time, for instance, running SOM in parallel had been focused in many previous research works. Utilization of the Graphics Processing Unit (GPU) as a parallel calculation engine is also continuously improved. However, total computation time in parallel SOM is still not optimal on processing large dataset. In this research, we propose a combination of Dynamic Parallel and Hyper-Q to further improve the performance of parallel SOM in terms of faster computing time. Dynamic Parallel and Hyper-Q are utilized on the process of calculating distance and searching best-matching unit (BMU), while updating weight and its neighbors are performed using Hyper-Q only. Result of this study indicates an increase in SOM parallel performance up to two times faster compared to those without using Dynamic Parallel and Hyper-Q.

Published
2018-08-03
How to Cite
Sibero, A., Sitompul, O., & Nasution, M. (2018). Enhancing Performance of Parallel Self-Organizing Map on Large Dataset with Dynamic Parallel and Hyper-Q. Data Science: Journal of Computing and Applied Informatics, 2(2), 62-73. https://doi.org/10.32734/jocai.v2.i2-324