A density peaks clustering algorithm with sparse search and K-d tree. (arXiv:2203.00973v2 [stat.ML] UPDATED)

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 density
peaks clustering algorithm with sparse search and K-d tree is developed to
solve this problem. Firstly, a sparse distance matrix is calculated by using
K-d tree to replace the original full rank distance matrix, so as to accelerate
the calculation of local density. Secondly, a sparse …

algorithm arxiv clustering clustering algorithm ml search tree