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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information sciences Jg. 647; S. 119470
Hauptverfasser:	Li, Chao, Ding, Shifei, Xu, Xiao, Hou, Haiwei, Ding, Ling
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.11.2023
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!