The optimization of the weblog central cluster using the genetic K means algorithm
Clustering is part of data mining. Clustering is used to group objects so that one group has the same characteristics. K means widely used because it is relatively easy to use. However K means has shortcomings. K means depends on the initial centroid. Selection of initial centroid done randomly so that the cluster formed is often not optimal. The clustering results are sometimes good and sometimes bad. In this research, the Genetic K means Algorithm is used to improve K means method. Genetic algorithm method is used to find the initial centroid. The initial centroid will be used by K means. So K means can get the optimal cluster. Cluster results is validated by SSW (Sum of Square within Cluster) and SI (Silhouette Index) SSW values by Genetic K means Algorithm amounted 1,648,150,772.8 and K means amounted 2.390.800.216,39. In this research, it was found that Genetic K means Algorithm creates a homogenous cluster of 45% better than the K means. So Genetic K means Algorithm more accurate than K means in determining patterns of data.
2016 International Seminar on Application for Technology of Information and Communication (ISemantic)