Clustering by Detecting Density Peaks and Assigning Points by Similarity-First Search Based on Weighted K-Nearest Neighbors Graph

Clustering by Detecting Density Peaks and Assigning Points by Similarity-First Search Based on Weighted K-Nearest Neighbors Graph

This paper presents an improved clustering algorithm for categorizing data with arbitrary shapes. Most of the conventional clustering approaches work only with round-shaped clusters. This task can be accomplished by quickly searching and finding clustering methods for density peaks (DPC), but in som...

Full description

Saved in:
Bibliographic Details
Main Authors: Qi Diao, Yaping Dai, Qichao An, Weixing Li, Xiaoxue Feng, Feng Pan
Format: Article
Language:English
Published: Wiley 2020-01-01
Series:Complexity
Online Access:http://dx.doi.org/10.1155/2020/1731075
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items

Similar Items