Fast density peaks clustering algorithm based on improved mutual K-nearest-neighbor and sub-cluster merging

Density peaks clustering (DPC) has had an impact in many fields, as it can quickly select centers and effectively process complex data. However, it also has low operational efficiency and a “Domino” effect. To solve these defects, we propose a fast density peaks clustering algorithm based on improve...

Celý popis

Podrobná bibliografie

Vydáno v:	Information sciences Ročník 647; s. 119470
Hlavní autoři:	Li, Chao, Ding, Shifei, Xu, Xiao, Hou, Haiwei, Ding, Ling
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Inc 01.11.2023
Témata:	Density peaks clustering Improved mutual K-nearest-neighbor Kd-tree Sparse matrix Sub-cluster merging Sparse matrix Sub-cluster merging Kd-tree Improved mutual K-nearest-neighbor Density peaks clustering
ISSN:	0020-0255
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!