OPTIMIZATION OF K-MEANS CLUSTERING USING PARTICLE SWARM OPTIMIZATION ALGORITHM FOR GROUPING TRAVELER REVIEWS DATA ON TRIPADVISOR SITES

Abstract

K-Means Algorithm can be used to group tourists based on reviews on tourist destination objects. This algorithm has a weakness that is sensitive to the determination of the initial centroid. The initial centroid that is determined at random will decreasing the level accuracy, often gets stuck at the local optimum, and gets a random solution. Optimization algorithms such as PSO can overcome this by determining the optimal initial centroid. The optimal number of clusters (K) will be determined using the Elbow method by calculating the SSE value of the resulting cluster. The average Silhouette Coefficient (SC) is used to measure the quality of the clusters produced by the K-Means Algorithm with and without the PSO Algorithm. This study uses secondary data obtained from the UCI Machine Learning Repository with the name Travel Reviews Data Set which consists of 980 records and 10 attributes. The test results show that K=2 is the optimal number of clusters. The K-Means and PSO Algorithm gives an average SC value of 0.300358 which is better than without the PSO Algorithm of 0.300076. The optimal PSO hyperparameter generated is the number of particles=30, \varphi_1=2.2, and {\ \varphi}_2=3 at maximum iteration of 100.