arrow
返回

DPCG: an efficient density peaks clustering algorithm based on grid

delete2016-09-26
delete51
PRE
AI
S
Shifei Ding *
M
Mingjing Du
Y
Yu Xue
DOI:10.1007/s13042-016-0603-2delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

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总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

International Journal of Machine Learning and Cybernetics 封面图
International Journal of Machine Learning and Cybernetics
IF:
2.7
论文数:
3.2K
被引数:
5.6K

机构

I
institute of computing technology, cas
学者数:
1.0K
论文数: 878
被引数: 1
引用论文

引用论文

Nonminimal dark sectors: Mediator-induced decay chains and multijet collider signatures
err2020-04-15
err0
errOAAI
errKeith R. Dienes; Doojin Kim; Huayang Song; Shufang Su; Brooks Thomas; David Yaylali
err分享
err收藏
学者 查看更多内容