Density Peak Clustering Based on Relative Density Optimization
Among numerous clustering algorithms, clustering by fast search and find of density peaks (DPC) is favoured because it is less affected by shapes and density structures of the data set. However, DPC still shows some limitations in clustering of data set with heterogeneity clusters and easily makes m...
Main Authors: | Chunzhong Li, Yunong Zhang |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2020-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2020/2816102 |
Similar Items
-
Clustering Algorithm Based on Density Peak and Neighbor Optimization
by: HE Yunbin, DONG Heng, WAN Jing, LI Song
Published: (2020-04-01) -
Density Peaks Clustering with Optimized Allocation Strategy
by: DING Zhicheng, GE Hongwei
Published: (2020-05-01) -
Structure Identification-Based Clustering According to Density Consistency
by: Chunzhong Li, et al.
Published: (2011-01-01) -
A Novel Density Peaks Clustering Algorithm Based on Local Reachability Density
by: Hanqing Wang, et al.
Published: (2020-06-01) -
A Density-Peak-Based Clustering Method for Multiple Densities Dataset
by: Zhicheng Shi, et al.
Published: (2021-09-01)