Proposed Modification of K-Means Clustering Algorithm with Distance Calculation Based on Correlation

Abstract

Clustering is a technique in data mining that groups a set of data into groups (clusters) of similar data. In general, there are two methods of clustering, namely the hierarchical method and the partition method. One of the most commonly used partition clustering methods in clustering is K-Means. The use of K-means method has been widely used in various fields with various purposes. Many research has been carried out to improve the performance of the K-Means method, for example, by modifying the method of determining the initial centroid or determining the appropriate number of clusters. In this research, the modification of the K-Means algorithm was carried out in calculating the distance by considering the correlation value between attributes. Attributes that have a high correlation value are assumed to have similar characteristics so that they determine the location of data in a particular cluster. The steps of the proposed method are: calculating the correlation value between attributes, determining the cluster centroid, calculating the distance by considering the value of correlation, and determining the data into certain clusters. The first contribution of this research is to propose a new distance calculation technique in the K-Means algorithm by considering correlation and the second contribution is to apply the proposed algorithm to a specific dataset, namely Iris dataset. In this research, the performance calculation of the modified algorithm was also carried out. From the experimental results using the Iris dataset, the proposed modification of the K-Means algorithm has fewer iterations than the original K-Means method, so that it requires less processing time. The original K-Means method requires 8 iterations, while the proposed method requires only 6 iterations. The proposed method also produces a higher accuracy rate of 89.33% than the original K-Means method, which is 82.67%.