2023
DOI: 10.1016/j.neucom.2023.126633
|View full text |Cite
|
Sign up to set email alerts
|

An overview on density peaks clustering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(6 citation statements)
references
References 110 publications
0
6
0
Order By: Relevance
“…DPC was originally proposed by Rodriguez and Laio for data point clustering and has received considerable interest in pattern recognition [26]. In [31] Wei et al presented an overview on DPC to first analyze the theory of DPC and its performance advantages and disadvantages and then summarizes the improvement of DPC in recent years through the improvement effect via experiments and new ideas for improving DPC algorithm in the future. Most recently, Tobin and Zhang [32] provided theoretical properties that characterize DPC and further develops a clustering algorithm, called Component-wise Peak-Finding (CPF) to deal with detection of erroneous points with high density and large distance to points of higher density as well as incoherent cluster assignment caused by noise.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…DPC was originally proposed by Rodriguez and Laio for data point clustering and has received considerable interest in pattern recognition [26]. In [31] Wei et al presented an overview on DPC to first analyze the theory of DPC and its performance advantages and disadvantages and then summarizes the improvement of DPC in recent years through the improvement effect via experiments and new ideas for improving DPC algorithm in the future. Most recently, Tobin and Zhang [32] provided theoretical properties that characterize DPC and further develops a clustering algorithm, called Component-wise Peak-Finding (CPF) to deal with detection of erroneous points with high density and large distance to points of higher density as well as incoherent cluster assignment caused by noise.…”
Section: Methodsmentioning
confidence: 99%
“…According to (31) and (34), the b c -DPC-BS and k-DPC-BS scores do not take into account the inter-band correlation, and neither do ECA, E-FDPC, IaDPA, or k-SNNC. So, to address this issue, a new concept derived from prominent band peaks proposed in [5], called band prominence value (BPV), BPV(b i ) for each band vector b i is introduced into DPC as a third indicator.…”
Section: Bdpc-bsmentioning
confidence: 99%
“…The traditional density peak algorithm [20][21][22] is a clustering algorithm used for partitioning data into clusters based on their density, which is capable of handling discrete datasets exhibiting a wide range of shapes, densities, and distributions. The core idea of this algorithm is that several density regions exhibit well-defined boundaries in a dataset.…”
Section: Prerequisite 21 Traditional Density Peak Modelmentioning
confidence: 99%
“…Definition 2 density following distance δ. The density following distance δ of a point represents the distance to the nearest higher-density point [21] and can be defined as follows:…”
Section: Prerequisite 21 Traditional Density Peak Modelmentioning
confidence: 99%
See 1 more Smart Citation