Fast density peaks clustering algorithm in polar coordinate system
Density peaks clustering (DPC) algorithm provides an efficient method to quickly find cluster centers with decision graphs. In recent years, due to its unique parameters, no iteration, and good robustness, it has been widely studied and applied. However, it also has some shortcomings, such as no adaptability, inadaptability to high-dimensional data and accuracy is easily affected. For reducing the higher time complexity of DPC, we introduce the polar coordinates to DPC (PC-DPC). Firstly, obtain the distance from every point to third-party point and the cosine value of the angle formed with the third-party vector, and reorder the points by distances and cosine values. Then, select other points in the adjacent sequence number of each point to calculate distances, and build a sparse distance matrix. Finally, the sparse distance matrix is used as the input of DPC to obtain clustering results. Theoretical analysis and experiments show that, compared with DPC and other algorithms, PC-DPC greatly reduces running time of DPC while maintaining clustering precision.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringSimilar Papers 제목 키워드 기반
A fast density peak clustering based particle swarm optimizer for dynamic optimization
Dynamic optimization problems (DOPs) are optimization problems with time evolution characteristics. In this type of problem, the decision variables and the state variables change over time and produce results that will…
ClusteringDiversityAn Improved Probability Propagation Algorithm for Density Peak Clustering Based on Natural Nearest Neighborhood
Clustering by fast search and find of density peaks (DPC) (Since, 2014) has been proven to be a promising clustering approach that efficiently discovers the centers of clusters by finding the density peaks. The accuracy …
ClusteringNonparametric ClusteringPECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search
This paper studies density-based clustering of point sets. These methods use dense regions of points to detect clusters of arbitrary shapes. In particular, we study variants of density peaks clustering, a popular type of…
ClusteringA novel density peaks clustering algorithm based on K nearest neighbors with adaptive merging strategy
Recently the density peaks clustering algorithm (DPC) has received a lot of attention from researchers. The DPC algorithm is able to find cluster centers and complete clustering tasks quickly. It is also suitable for di…
ClusteringA density peaks clustering algorithm with sparse search and K-d tree
Density peaks clustering has become a nova of clustering algorithm because of its simplicity and practicality. However, there is one main drawback: it is time-consuming due to its high computational complexity. Herein, a…
2kClustering