Dynamic graph-based label propagation for density peaks clustering
作者：
Highlights：
• A novel dynamic density peaks clustering method called DPC-DLP is proposed.
• The idea of k-nearest neighbors is used to compute the cut-off and local density of points.
• A graph-based label propagation mechanism to distribute labels and form final clusters.
• DPC_DLP can effectively assign true labels to border points located in overlapped regions.
• The results of experiments reveal the effectiveness of the proposed method.
摘要
•A novel dynamic density peaks clustering method called DPC-DLP is proposed.•The idea of k-nearest neighbors is used to compute the cut-off and local density of points.•A graph-based label propagation mechanism to distribute labels and form final clusters.•DPC_DLP can effectively assign true labels to border points located in overlapped regions.•The results of experiments reveal the effectiveness of the proposed method.
论文关键词：Density peaks clustering,Soft clustering,Label propagation,Graph-based clustering
论文评审过程：Received 19 January 2018, Revised 30 July 2018, Accepted 31 July 2018, Available online 1 August 2018, Version of Record 20 August 2018.
论文官网地址：https://doi.org/10.1016/j.eswa.2018.07.075
