.png){kind=icon}
Return
An efficient clustering algorithm based on searching popularity peaks
.png){kind=icon}
PRE
AI
DOI：10.1007/s10044-024-01261-4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In order to address some deficiencies of the density peak clustering algorithm, namely sensitivity to density kernels and challenges with large density differences across clusters, we propose a popularity peak clustering algorithm that is based on a more robust notion of density called popularity. The popularity of a sample is computed according to the number, similarity and popularity of points that have the sample in their k-nearest neighbors. The popularity concept has some properties that help in handling challenges like identifying cluster centers in sparse regions and handling situations with large density differences across clusters. Moreover, in the density peak clustering algorithm, the strategy of assigning non-center points to the same cluster as their nearest higher-density neighbor can cause error propagation. To address this issue, we also propose a new popularity-based label assignment strategy. Our results demonstrate that the proposed algorithm can recognize clusters regardless of their densities and overlap degree and can often outperform the existing density peak clustering algorithms.
Keywords:
Density peaks clustering
Label propagation strategy
Popularity peaks clustering
Varying densities
Journal
IF:
2
Papers:
2.0K
Citations:
1.9K
Organization
No organization information available
Cited Papers
ShareSaveOptical sensors based on III-nitride photodetectors for flame sensing and combustion monitoring
PREAI
ShareSaveStudy on density peaks clustering based on k-nearest neighbors and principal component analysis
PREAI
ShareSaveDensity peaks clustering based on density backbone and fuzzy neighborhood.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
ShareSave
View more