Skripsi
MENGUKUR KINERJA CLUSTERING MENGGUNAKAN ALGORITMA K-MEANS DAN K-MEDOIDS DENGAN OPTIMASI SILHOUETTE COEFFICIENT
Clustering is one of the most widely used techniques in data processing that can be used to find patterns and characteristics in data. K-Means and K-Medoids are the most widely used clustering algorithms because they are simple, easy to implement, and relatively fast. Although proven to have good performance with high accuracy and efficiency for large data, previous studies have shown differences in clustering results between the two algorithms. Therefore, this study measures and compares the performance of K-Means and K-Medoids by applying Silhouette Coefficient optimization. Silhouette Coefficient is used to determine the optimal number of clusters based on the average silhouette value to optimize clustering performance. Tests were conducted by applying the K-Means, K-Medoids, and Silhouette Coefficient algorithms on three different datasets obtained from Kaggle in the range of 2 to 10 clusters. Evaluation of the clustering performance was done using Silhouette Score. The results show that the optimal number of clusters for all datasets is 2, both in the K-Means and K-Medoids algorithms. However, the K-Means algorithm shows better performance than K-Medoids with higher Silhouette Score values and close to 1. The highest Silhouette Score values of K-Means in the three datasets are 0.7099, 0.7674, and 0.7716, respectively. The K-Medoids are 0.7064, 0.7445, and 0.7257.
Inventory Code | Barcode | Call Number | Location | Status |
---|---|---|---|---|
2407004022 | T149530 | T1495302024 | Central Library (REFERENCES) | Available but not for loan - Not for Loan |
No other version available