基于密度峰的聚类中密度参数的评价

Jian Hou, Wei-Xue Liu
{"title":"基于密度峰的聚类中密度参数的评价","authors":"Jian Hou, Wei-Xue Liu","doi":"10.1109/ICICIP.2016.7885878","DOIUrl":null,"url":null,"abstract":"The density peak based clustering algorithm is a simple yet effective clustering approach. This algorithm firstly calculates the local density of each data and the distance to the nearest neighbor with higher density. Based on the assumption that cluster centers are density peaks and they are relatively far from each other, this algorithm isolates the candidates of cluster centers from the non-center data. After the cluster centers are identified, the other data are assigned labels equaling to those of their nearest neighbors with higher density. In this way the clustering can be accomplished efficiently and clusters of arbitrary shapes can be obtained. The key of the density peak based clustering algorithm lies in the density calculation method. In this paper we study the influence of the data amount used in density calculation on the clustering results of the density peak based algorithm. As a result, we arrive at some conclusions on the selection of the data amount, which can be useful in applying this algorithm in real tasks.","PeriodicalId":226381,"journal":{"name":"2016 Seventh International Conference on Intelligent Control and Information Processing (ICICIP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Evaluating the density parameter in density peak based clustering\",\"authors\":\"Jian Hou, Wei-Xue Liu\",\"doi\":\"10.1109/ICICIP.2016.7885878\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The density peak based clustering algorithm is a simple yet effective clustering approach. This algorithm firstly calculates the local density of each data and the distance to the nearest neighbor with higher density. Based on the assumption that cluster centers are density peaks and they are relatively far from each other, this algorithm isolates the candidates of cluster centers from the non-center data. After the cluster centers are identified, the other data are assigned labels equaling to those of their nearest neighbors with higher density. In this way the clustering can be accomplished efficiently and clusters of arbitrary shapes can be obtained. The key of the density peak based clustering algorithm lies in the density calculation method. In this paper we study the influence of the data amount used in density calculation on the clustering results of the density peak based algorithm. As a result, we arrive at some conclusions on the selection of the data amount, which can be useful in applying this algorithm in real tasks.\",\"PeriodicalId\":226381,\"journal\":{\"name\":\"2016 Seventh International Conference on Intelligent Control and Information Processing (ICICIP)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"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.7885878\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","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.7885878","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

基于密度峰的聚类算法是一种简单而有效的聚类方法。该算法首先计算每个数据的局部密度和到密度较高的最近邻居的距离。该算法假设聚类中心为密度峰,且聚类中心之间相对较远,将候选聚类中心从非中心数据中分离出来。在识别出集群中心后,其他数据被分配到与其密度更高的最近邻居相同的标签。这种方法可以有效地完成聚类,得到任意形状的聚类。基于密度峰的聚类算法的关键在于密度计算方法。本文研究了密度计算中使用的数据量对基于密度峰值算法聚类结果的影响。最后得出了一些关于数据量选择的结论,对实际任务中的应用具有一定的指导意义。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Evaluating the density parameter in density peak based clustering
The density peak based clustering algorithm is a simple yet effective clustering approach. This algorithm firstly calculates the local density of each data and the distance to the nearest neighbor with higher density. Based on the assumption that cluster centers are density peaks and they are relatively far from each other, this algorithm isolates the candidates of cluster centers from the non-center data. After the cluster centers are identified, the other data are assigned labels equaling to those of their nearest neighbors with higher density. In this way the clustering can be accomplished efficiently and clusters of arbitrary shapes can be obtained. The key of the density peak based clustering algorithm lies in the density calculation method. In this paper we study the influence of the data amount used in density calculation on the clustering results of the density peak based algorithm. As a result, we arrive at some conclusions on the selection of the data amount, which can be useful in applying this algorithm in real tasks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信