首页> 外文会议>2017 International Conference on Security, Pattern Analysis, and Cybernetics >A novel density peak clustering algorithm based on squared residual error
【24h】

A novel density peak clustering algorithm based on squared residual error

机译:一种基于平方残差的密度峰值聚类算法

获取原文
获取原文并翻译 | 示例

摘要

The density peak clustering (DPC) algorithm is designed to quickly identify intricate-shaped clusters with high dimensionality by finding high-density peaks in a non-iterative manner and using only one threshold parameter. However, DPC has certain limitations in processing low-density data points because it only takes the global data density distribution into account. As such, DPC may confine in forming low-density data clusters, or in other words, DPC may fail in detecting anomalies and borderline points. In this paper, we analyze the limitations of DPC and propose a novel density peak clustering algorithm to better handle low-density clustering tasks. Specifically, our algorithm provides a better decision graph comparing to DPC for the determination of cluster centroids. Experimental results show that our algorithm outperforms DPC and other clustering algorithms on the benchmarking datasets.
机译:密度峰值聚类(DPC)算法旨在通过以非迭代方式查找高密度峰值并仅使用一个阈值参数来快速识别具有高维的复杂形状的聚类。但是,DPC在处理低密度数据点时有某些限制,因为它仅考虑了全局数据密度分布。这样,DPC可能会限制形成低密度数据簇,换句话说,DPC可能无法检测到异常和边界点。在本文中,我们分析了DPC的局限性,并提出了一种新的密度峰聚类算法,以更好地处理低密度聚类任务。具体而言,与DPC相比,我们的算法为确定聚类质心提供了更好的决策图。实验结果表明,在基准数据集上,我们的算法优于DPC和其他聚类算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号