.png){kind=icon}
返回
A Self-Representation Weighted-Based Density Peaks Clustering Method
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2024.3448472.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The approach to calculating density significantly impacts the clustering efficacy of the Density Peak Clustering (DPC) method, with various density calculation methods tailored for different datasets. To address this, this study introduces a Self-Representation Weighted Density Peak Clustering (SR-DPC) method. Unlike traditional DPC, SR-DPC not only utilizes the local data point information but also amplifies the impact of different data points on the data center by implementing a weighting strategy, enhancing the precision with which data centers are identified. Moreover, SR-DPC adaptively reflects the influence of diverse data points on the data centers via feature representation and employs a weighted Gaussian kernel distance instead of the Euclidean distance to boost its clustering capabilities. Experimental evaluations on both synthetic and real datasets demonstrate the effectiveness and practicality of the SR-DPC method.
Keyword:
Euclidean distance
Density measurement
Clustering methods
Clustering algorithms
Shape measurement
Representation learning
Gaussian processes
Feature detection
DPC
self-representation weighted
feature representation
adaptively
the weighted Gaussian kernel distance
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
Study on density peaks clustering based on k-nearest neighbors and principal component analysis基于k近邻和主成分分析的密度峰聚类研究
PREAI
分享收藏Graphene/Ionic Liquid Binary Electrode Material for High Performance Supercapacitor用于高性能超级电容器的石墨烯/离子液体二元电极材料
PREAI
分享收藏分享收藏
查看更多内容