A density peaks clustering algorithm with sparse search and K-d tree

no code implementations • 2 Mar 2022 • Yunxiao Shan, Shu Li, Fuxiang Li, Yuxin Cui, Shuai Li, Ming Zhou, Xiang Li

It is proved that the algorithm can effectively reduce the computational complexity of the original DPC from $O(n^2K)$ to $O(n(n^{1-1/K}+k))$.

2k Clustering