Comparison of Distance Function to Performance of K-Medoids Algorithm for Clustering
- 1 February 2020
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2020 International Conference on Smart Technology and Applications (ICoSTA)
Abstract
The clustering task aims to assign a cluster for each observation data in such a way that observations data within each cluster are more homogeneous to one another than with those in the other groups. Its wide applications in many research fields have motivated many researchers to propose a plethora of clustering algorithms. K-medoids are a prominent clustering algorithm as an improvement of the predecessor, K-Means algorithm. Despite its widely used and less sensitive to noises and outliers, the performance of K-medoids clustering algorithm is affected by the distance function. This paper presents experimentation findings to compare the performance of K-medoids clustering algorithm using Euclidean, Manhattan and Chebyshev distance functions. In this study the K-medoids algorithm was tested using the village status dataset from Gorontalo Province, Indonesia. Execution time and Davies Bouldin Index were used as performance metrics of the clustering algorithm. Experiment results showed that methods of Manhattan distance and Euclidean distance with the Index Davies value of 0.050.Keywords
This publication has 5 references indexed in Scilit:
- Comparison of Distance Methods in K-Means Algorithm for Determining Village Status in Bekasi DistrictPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2019
- K-means with Three different Distance MetricsInternational Journal of Computer Applications, 2013
- Computational Complexity between K-Means and K-Medoids Clustering Algorithms for Normal and Uniform Distributions of Data PointsJournal of Computer Science, 2010
- Finding Groups in Data: An Introduction to Cluster Analysis.Biometrics, 1991
- Least squares quantization in PCMIEEE Transactions on Information Theory, 1982