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

Full description

Bibliographic Details

Published in:	Information sciences Vol. 647; p. 119470
Main Authors:	Li, Chao, Ding, Shifei, Xu, Xiao, Hou, Haiwei, Ding, Ling
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.11.2023
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!