2020
DOI: 10.1109/access.2020.3006069
|View full text |Cite
|
Sign up to set email alerts
|

Effective Density Peaks Clustering Algorithm Based on the Layered K-Nearest Neighbors and Subcluster Merging

Abstract: Density peaks clustering (DPC) algorithm is a novel density-based clustering algorithm, which is simple and efficient, is not necessary to specify the number of clusters in advance, and can find any nonspherical class clusters. However, DPC relies heavily on the calculation methods of the cutoff distance threshold and local density and cannot analyze complex manifold data, especially datasets with uneven density distribution and multiple peaks in the same cluster. To solve these problems, we propose an improve… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 20 publications
(7 citation statements)
references
References 30 publications
0
5
0
Order By: Relevance
“…Each color stands for one cluster. We compared our method with five clustering methods: k-means [31], DBSCAN [13], DPC [18], DPSLC [32], and LKSM_DPC [33] by using ARI [34], AMI [35] and FMI [36]. ARI (Adjusted Rand Index) is a development of RI (Rand Index), which reflects the degree of overlap between two clusters.…”
Section: Resultsmentioning
confidence: 99%
“…Each color stands for one cluster. We compared our method with five clustering methods: k-means [31], DBSCAN [13], DPC [18], DPSLC [32], and LKSM_DPC [33] by using ARI [34], AMI [35] and FMI [36]. ARI (Adjusted Rand Index) is a development of RI (Rand Index), which reflects the degree of overlap between two clusters.…”
Section: Resultsmentioning
confidence: 99%
“…Because the DPC algorithm relies heavily on the cut-off distance threshold and the calculation method of local density, it cannot analyze complex manifold data, especially the datasets with uneven density distribution or multiple density peaks in the same cluster. To solve these problems, Ren et al [27] proposed an improved density peaks clustering algorithm based on the layered k-nearest neighbors and subcluster merging (LKSM_DPC) in 2020. Firstly, the algorithm rede ned the local density calculation method by using layered k-nearest neighbors.…”
Section: Dpc Based On the Layered K-nearest Neighbors And Subcluster ...mentioning
confidence: 99%
“…To verify the effectiveness of the CFDPC algorithm, we use 15 commonly used experimental datasets [41]- [44], and select nine artificial datasets from http://cs.joensuu.fi/sipu/datasets/ and six real datasets from http://archive.ics.uci.edu/ml, as listed in Table 1 and Table 2.…”
Section: Experimental Datasetsmentioning
confidence: 99%