Article Per Year (5 Year)
p-Index From 2020 - 2025
0.23
P-Index
This Author published in this journals
All Journal JATI (Jurnal Mahasiswa Teknik Informatika)
T.S, Muhammad Priyono
Unknown Affiliation
Computer Science & IT

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
IMPLEMENTASI EUCLIDEAN DAN CHEBYSHEV DISTANCE PADA K-MEDOIDS CLUSTERING I.R, Gea Putri; Aziz, Abdul; T.S, Muhammad Priyono
JATI (Jurnal Mahasiswa Teknik Informatika) Vol. 6 No. 2 (2022): JATI Vol. 6 No. 2
Publisher : Institut Teknologi Nasional Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36040/jati.v6i2.5443

Abstract

Clustering is one of the data mining techniques for grouping a set of data with similar characteristics in a cluster. Methods clustering, one of which is K-Medoids or PAM (Partitioning Around Medoids), an algorithm identical to k-means because it breaks the data set into groups. The algorithm k-medoids use to overcome the weakness of k-means which is sensitive to noise and outliers. The level of similarity of characteristics in clustering determines by measuring the distance between the data. This study uses Euclidean Distance and Chebyshev Distance to determine the cluster from each distance measure. This study compares Euclidean and Chebyshev distance implementation on k-medoids clustering. In this study, the group obtained using the Chebyshev distance on k-medoids produces a more optimal cluster.
Co-Authors Abdul Aziz I.R, Gea Putri