A Density Peaks Clustering Algorithm With Sparse Search and K-d Tree

A 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 density peaks clustering algorithm with sparse search and K-d tree is developed...

Full description

Bibliographic Details
Main Authors: Yunxiao Shan, Shu Li, Fuxiang Li, Yuxin Cui, Shuai Li, Ming Zhou, Xiang Li
Format: Article
Language:English
Published: IEEE 2022-01-01
Series:IEEE Access
Subjects:
Density peaks clustering
sparse search strategy
K-d tree
computational complexity
second-order difference method
Online Access:https://ieeexplore.ieee.org/document/9829753/

Internet

https://ieeexplore.ieee.org/document/9829753/

Similar Items