K-Means Performance Optimization Using Rank Order Centroid (ROC) And Braycurtis Distance
Open Access
- 1 April 2022
- journal article
- Published by Politeknik Ganesha in sinkron
- Vol. 7 (2), 472-478
- https://doi.org/10.33395/sinkron.v7i2.11371
Abstract
K-Means is a clustering algorithm that groups data based on similarities between data. Some of the problems that arise from this algorithm are when determining the center point of the cluster randomly. This will certainly affect the final result of a clustering process. To anticipate the poor accuracy value, a process is needed to determine the initial centroid in the initialization process. The second problem is when calculating the Euclidean distance on the distance between data. However, this method only gives the same impact on each data attribute. From some of these problems, this study proposes the Rank Order Centroid (ROC) method for initializing the cluster center point and using the Braycurtis distance method to calculate the distance between data. With the experiment K=2 to K=10, the results obtained in this study are the proposed method obtains an iteration reduction of 6.6% on the Student Performance Exams dataset and 19.3% on the Body Fat Prediction dataset. However, there was an increase in iterations on the Heart Failure dataset by 24.2%. In testing the cluster results using the Silhouette Coefficient, this method shows an increase in the evaluation value of 5.9% in the Student Performance Exams dataset. However, the evaluation value decreased by 8.3% in the Body Fat Prediction dataset and 3.3% in the Heart Failure dataset.Keywords
This publication has 13 references indexed in Scilit:
- Enhancement Clustering Evaluation Result of Davies-Bouldin Index with Determining Initial Centroid of K-Means AlgorithmJournal of Physics: Conference Series, 2019
- Analysis and Implementation of the Bray–Curtis Distance-Based Similarity Measure for Retrieving Information from the Medical RepositoryPublished by Springer Science and Business Media LLC ,2018
- Integration K-Means Clustering Method and Elbow Method For Identification of The Best Customer Profile ClusterIOP Conference Series: Materials Science and Engineering, 2018
- Silhouette index for determining optimal k-means clustering on images in different color modelsInternational Journal of Engineering & Technology, 2018
- An initial centroid selection method based on radial and angular coordinates for K-means algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2017
- An efficient approximation to the K-means clustering for massive dataKnowledge-Based Systems, 2017
- An intelligent system for clustering using hybridization of distance function in learning vector quantization algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2017
- Estimation of inter-centroid distance quality in data clustering problem using hybridized K-means algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2017
- Exploreing K-Means with Internal Validity Indexes for Data Clustering in Traffic Management SystemInternational Journal of Advanced Computer Science and Applications, 2017
- Compatible weighting method with rank order centroid: Maximum entropy ordered weighted averaging approachEuropean Journal of Operational Research, 2011