A KMeans Optimization Algorithm Based on Relative

Authors: Gang Liu Shaobin Huang Haiyan Chang

Publish Date: 2012

Volume: , Issue: , Pages: 385-391

PDF Link

Abstract

With the rapid development of the technology of cluster analysis people have proposed a lot of clustering algorithms such as the Kmeans clustering algorithm which is simple low complexity and has been used widely and it has been the improved object or base for many other algorithms This paper presents a Kmeans optimization algorithm based on relative core cluster RCBKmeans The algorithm is based on the core group uses the center of the relative core cluster of the data set as the initial center of the Kmeans algorithm thus avoiding the local optimization problem of the clustering results which caused by selecting the initial center randomly of the classic Kmeans algorithm and improving the algorithm results effectively

Keywords: