Improved the Performance of the K-Means Cluster Using the Sum of Squared Error (SSE) optimized by using the Elbow Method

Abstract K-Means is a simple clustering algorithm that has the ability to throw large amounts of data, partition datasets into several clusters k. The algorithm is quite easy to implement and run, relatively fast and efficient. Another division of K-Means still has several weaknesses, namely in determining the number of clusters, determining the cluster center. The results of the cluster formed from the K-means method is very dependent on the initiation of the initial cluster center value provided. This causes the results of the cluster to be a solution that is locally optimal. This research was conducted to overcome the weaknesses in the K-Means algorithm, namely: improvements to the K-Means algorithm produce better clusters, namely the application of Sum Of Squared Error (SSE) to help K-Means Clustering in determining the optimum number of clusters, From this modification process, it is expected that the cluster center obtained will produce clusters, where the cluster members have a high level of similarity. Improving the performance of the K-Means cluster will be applied to determining the number of clusters using the elbow method.