关键词: 聚类, 二分K-均值算法, 密度, 邻域半径, 指数函数, 中心指标

Abstract: Aiming at the problem of unstable clustering results caused by the random selection of initial centers and artificially defining the number of clusters in the bisecting K-means algorithm, a Canopy bisecting K-means algorithm based on density and center index is proposed. Firstly, the algorithm calculates the data density in the sample and its neighborhood radius. Secondly, the data with the smallest density are selected and the ideas of the Canopy algorithm is combined for clustering. The number of clusters and cluster centers are obtained as the input parameters of the bisecting K-means algorithm. Finally, based on the bisecting K-means algorithm, the exponential function and central index are introduced to cluster the original samples. UCI data set and self-built data set were used to compare simulation experiments. The results show that the algorithm not only makes the clustering results more accurate and faster, but also has better stability.

Key words: clustering, bisecting K-Means algorithm, density, neighborhood radius, exponential function, central index