Non-iterative border-peeling clustering algorithm based on swap strategy.

Border-Peeling algorithm is a recently proposed density based clustering algorithm. The method of peeling off border points by continuous iteration and calculating the density influence value by using the Gaussian kernel distance makes the algorithm more complex. At the same time, there is a risk of excessive peeling of small clusters on unbalanced datasets, which leads to a large number of noise misidentification. In order to reduce the time consumption and improve the clustering performance on unbalanced datasets, this paper proposes a non-iterative border-peeling clustering algorithm. First, the potential core points are determined by the centroids of k-nearest neighbor. Secondly, the points with lower local relative density in the core points and the points with higher relative density in the border points are exchanged to complete the distinction between the core points and the border points. Then basic DBSCAN method is used to cluster core points and noise points. Finally, the associations between the border points and the core points are based on the number of reverse nearest neighbors of the border points in the core points. Our method has achieved competitive results on 10 synthetic datasets and 8 UCI real-world datasets. [ABSTRACT FROM AUTHOR]