Study on a density peak based clustering algorithm

Wei-Xue Liu, Jian Hou
{"title":"Study on a density peak based clustering algorithm","authors":"Wei-Xue Liu, Jian Hou","doi":"10.1109/ICICIP.2016.7885877","DOIUrl":null,"url":null,"abstract":"The density peak based clustering algorithm is a recently proposed clustering approach. It uses the local density of each data and the distance to the nearest neighbor with higher density to isolate and identify the cluster centers. After the cluster centers are identified, the other data are assigned labels equaling to those of their nearest neighbors with higher density. This algorithm is simple and efficient. On condition that the cluster centers are identified correctly, it can generate very good clustering results. However, the results of this algorithm depend on a parameter in the local density calculation. In this paper we investigate the influence of the parameter on the clustering results through extensive experiments on several datasets. Our work can be useful in applying the density peak based clustering algorithm to practical tasks.","PeriodicalId":226381,"journal":{"name":"2016 Seventh International Conference on Intelligent Control and Information Processing (ICICIP)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 Seventh International Conference on Intelligent Control and Information Processing (ICICIP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICIP.2016.7885877","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

The density peak based clustering algorithm is a recently proposed clustering approach. It uses the local density of each data and the distance to the nearest neighbor with higher density to isolate and identify the cluster centers. After the cluster centers are identified, the other data are assigned labels equaling to those of their nearest neighbors with higher density. This algorithm is simple and efficient. On condition that the cluster centers are identified correctly, it can generate very good clustering results. However, the results of this algorithm depend on a parameter in the local density calculation. In this paper we investigate the influence of the parameter on the clustering results through extensive experiments on several datasets. Our work can be useful in applying the density peak based clustering algorithm to practical tasks.
一种基于密度峰值的聚类算法研究
基于密度峰的聚类算法是近年来提出的一种聚类方法。它利用每个数据的局部密度和到密度较高的最近邻居的距离来隔离和识别聚类中心。在识别出集群中心后,其他数据被分配到与其密度更高的最近邻居相同的标签。该算法简单、高效。在正确识别聚类中心的前提下,可以得到很好的聚类结果。然而,该算法的结果依赖于局部密度计算中的一个参数。本文通过对多个数据集的大量实验,研究了参数对聚类结果的影响。我们的工作对于将基于密度峰的聚类算法应用到实际任务中是有用的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信