입자 군집 최적화 알고리즘을 통한 K-평균 군집화 개선

Improvement of K-means Clustering Through Particle Swarm Optimization

Unsupervised learning is a type of machine learning, and unlike supervised learning or reinforcement learning, a target value for input value is not given. Clustering is mainly used for such unsupervised learning. One of the representative methods of such clustering is K-means clustering. Since K-means clustering is a method of determining the number of clusters and continuing to find the central point of the data allocated to the cluster, there is a problem that the clustered group may not be the optimal cluster. In this study, particle swarm optimization algorithm, which determines the motion vector by adding various variables as well as the center point, is applied to K-means clustering. The improved K-means clustering makes it possible to move toward better outcome values even when the center of cluster no longer change. In the conventional clustering method, the center of the cluster moves to the center of the data belonging to the cluster, and clustering ends when the cluster does not change, so other characteristics other than the center value are excluded. Unlike the conventional clustering method, the improved clustering method uses a central value, an average value, and a random value as variables, and a particle swarm optimization algorithm that modifies the vector for each iteration is applied. As a result, improved clustering method derived a better result value than the existing clustering method in the group's fitness index, silhouette score.