Clustering spatial data by the neighbors intersection and the density difference

Clustering is a classical unsupervised learning task, which is aimed to divide a data set into several groups with similar objects. Clustering problem has been studied for many years, and many excellent clustering algorithms have been proposed. In this paper, we propose a novel clustering method based on density, which is simple but effective. The primary idea of the proposed method is given as follows. Firstly, the point with the largest local density in a cluster is considered as the cluster center. The local density of each point is estimated based on the distance (called radius) between the point and its k-th nearest neighbor. The point with a smaller radius indicates a larger local density. Secondly, the difference of the local densities between each two internal points should be small, while the difference between the density of a border point and the density of an internal point should be relatively large. Thirdly, if the intersection of k nearest neighbors of two points is small, they should be assigned to different clusters. The proposed algorithm has been compared with a typical clustering algorithm named FDPCluster, and the experimental results show that our algorithm has better clustering quality.