返回
DPCG: an efficient density peaks clustering algorithm based on grid
DOI:10.1007/s13042-016-0603-2.png)
摘要
En 中文
To deal with the complex structure of the data set, density peaks clustering algorithm (DPC) was proposed in 2014. The density and the delta-distance are utilized to find the clustering centers in the DPC method. It detects outliers efficiently and finds clusters of arbitrary shape. But unfortunately, we need to calculate the distance between all data points in the first process, which limits the running speed of DPC algorithm on large datasets. To address this issue, this paper introduces a novel approach based on grid, called density peaks clustering algorithm based on grid (DPCG). This approach can overcome the operation efficiency problem. When calculating the local density, the idea of the grid is introduced to reduce the computation time based on the DPC algorithm. Neither it requires calculating all the distances nor much input parameters. Moreover, DPCG algorithm successfully inherits the all merits of the DPC algorithm. Experimental results on UCI data sets and artificial data show that the DPCG algorithm is flexible and effective.
Keyword:
Cluster analysis
DPC algorithm
CLIQUE algorithm
DPCG algorithm
Operational efficiency
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.7
论文数:
3.2K
被引数:
5.6K
机构
引用论文
Full Valence Band Photoemission from Liquid Water Using EUV Synchrotron Radiation使用EUV同步加速器辐射从液态水中全价带光发射
Study on density peaks clustering based on k-nearest neighbors and principal component analysis基于k近邻和主成分分析的密度峰聚类研究
COMPARISON OF HEMODYNAMIC AND REGIONAL BLOOD FLOW CHANGES AT EQUIVALENT STAGES OF ENDOTOXIN AND HEMORRHAGIC SHOCK内毒素休克和失血性休克等效阶段时的血流动力学和区域性血流变化比较

