PERBANDINGAN DISTANCE MEASURES PADA K-MEANS CLUSTER DAN TOPSIS DENGAN KORELASI PEARSON DAN SPEARMAN
DOI:
https://doi.org/10.55606/jitek.v3i1.1394Keywords:
K-Means, TOPSIS, Euclidean distance, Manhattan distance, Minkowsky distance.Abstract
Clustering is a data mining method that is widely used to group data based on similarity. This clustering process can be used to streamline data so as to facilitate the data ranking process. The purpose of this study was to make comparisons of distance measurements on the K-Means and TOPSIS methods to select students who would take part in industrial visit activities. The method used in this study is the K-Means Algorithm to carry out the clustering process whose results will be processed using the TOPSIS method, both of which use Euclidean, Manhattan and Minkowsky Distance. Based on the clustering process, there were 21 respondents who were eligible to be included, then with TOPSIS a ranking process was carried out. Of the three distance measurements used based on the Pearson Euclidean distance correlation test, the highest results were 0.992, Manhattan 0.982 and Minkowsky 0.980, with ratings one, two and three respectively. For the Spearman correlation, Eculidean is 0.972, Manhattan is 0.982 and Minkowski is 0.955. Thus, Euclidean distance gives the best correlation results, while for alternatives, Manhattan distance or Minkoesky distance can be used.
References
D. J. Bora and D. A. K. Gupta, “Effect of Different Distance Measures on the Performance of K-Means Algorithm: An Experimental Study in Matlab,” vol. 5, 2014.
A. B. Rathod, S. M. Gulhane, and S. R. Padalwar, “A comparative study on distance measuring approches for permutation representations,” in 2016 IEEE International Conference on Advances in Electronics, Communication and Computer Technology (ICAECCT), Pune, India: IEEE, Dec. 2016, pp. 251–255. doi: 10.1109/ICAECCT.2016.7942593.
S. B. H. Sakur, M. Silangen, and D. Tuwohingide, “Penerapan Algoritma K-Means Cluster dan Metode TOPSIS pada Pemilihan Mahasiswa kunjungan Industri,” Jutisi J. Ilm. Tek. Inform. Dan Sist. Inf., vol. 11, no. 3, Art. no. 3, Dec. 2022, doi: 10.35889/jutisi.v11i3.1045.
S. B. H. Sakur, M. Silangen, and E. H. Israel, “Penggunaan Metode Technique For Order Performance Of Similarity To Ideal Solution (TOPSIS) Dan Vector Normalization Pada Pemilihan Mahasiswa Kunjungan Industri,” Politeknik Negeri Nusa Utara, Tahuna, Laporan Penelitian Unggulan Perguruan Tinggi 461/Sistem Informasi, Nov. 2021.
M. Anggara, H. Sujiani, and H. Nasution, “Pemilihan Distance Measure Pada K-Means Clustering Untuk Pengelompokkan Member Di Alvaro Fitness,” vol. 1, no. 1, Art. no. 1, 2016.
M. Nishom, “Perbandingan Akurasi Euclidean Distance, Minkowski Distance, dan Manhattan Distance pada Algoritma K-Means Clustering berbasis Chi-Square,” J. Inform. J. Pengemb. IT, vol. 4, no. 1, pp. 20–24, Jan. 2019, doi: 10.30591/jpit.v4i1.1253.
S. B. H. Sakur and M. Silangen, “ANALISIS PERBANDINGAN NORMALISASI DARI METODE ANALYTICAL HIERARCHY PROCESS TERHADAP METODE SIMPLE MULTI ATTRIBUTE RATING TECHNIQUE UNTUK PEMILIHAN MAHASISWA BERPRESTASI,” Politeknik Negeri Nusa Utara, Tahuna, Laporan Penelitian Unggulan Perguruan Tinggi 461/Sistem Informasi, Nov. 2022.
J. Irani, N. Pise, and M. Phatak, “Clustering Techniques and the Similarity Measures used in Clustering: A Survey,” Int. J. Comput. Appl., vol. 134, no. 7, Art. no. 7, Jan. 2016, doi: 10.5120/ijca2016907841.
Haviluddin et al., “A Performance Comparison of Euclidean, Manhattan and Minkowski Distances in K-Means Clustering,” in 2020 6th International Conference on Science in Information Technology (ICSITech), Palu, Indonesia: IEEE, Oct. 2020, pp. 184–188. doi: 10.1109/ICSITech49800.2020.9392053.
P. Arora, Deepali, and S. Varshney, “Analysis of K-Means and K-Medoids Algorithm For Big Data,” Procedia Comput. Sci., vol. 78, pp. 507–512, 2016, doi: 10.1016/j.procs.2016.02.095.
S. B. H. Sakur, “Data Excel Proses Analisis Kunjungan Industri Metode TOPSIS.” Data Excel, Google Drive, Nov. 06, 2021. Accessed: Apr. 05, 2023. [Excel]. Available: https://drive.google.com/file/d/1Z8UmqyJ7v5Nc4Y42zLWOv7kxjzoI78ny/view
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 Jurnal Informatika Dan Tekonologi Komputer (JITEK)
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
