关键词: 聚类, K均值算法, 点密度

Abstract:

Traditional Kmeans clustering algorithms are sensitive to the selection of initial clustering centers and isolated points. Considering these problems, a new method based on the density of points is presented in this paper. First of all, we select initial clustering centers through the proposed method. Then, we apply a Kmeans clustering algorithm to cluster the data, and process the isolated points especially. The experimental results demonstrate that the proposed method can get better clustering results.

Key words: clustering;Kmeans clustering algorithm;density of points