McDPC : multi-center density peak clustering
Density peak clustering (DPC) is a recently developed density-based clustering algorithm that achieves competitive performance in a non-iterative manner. DPC is capable of effectively handling clusters with single density peak (single center), i.e., based on DPC’s hypothesis, one and only one data p...
Saved in:
Main Authors: | , , , , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/144300 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-144300 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1443002020-10-27T07:15:28Z McDPC : multi-center density peak clustering Wang, Yizhang Wang, Di Zhang, Xiaofeng Pang, Wei Miao, Chunyan Tan, Ah-Hwee Zhou, You School of Computer Science and Engineering Engineering::Computer science and engineering Density Peak Clustering Image Segmentation Density peak clustering (DPC) is a recently developed density-based clustering algorithm that achieves competitive performance in a non-iterative manner. DPC is capable of effectively handling clusters with single density peak (single center), i.e., based on DPC’s hypothesis, one and only one data point is chosen as the center of any cluster. However, DPC may fail to identify clusters with multiple density peaks (multi-centers) and may not be able to identify natural clusters whose centers have relatively lower local density. To address these limitations, we propose a novel clustering algorithm based on a hierarchical approach, named multi-center density peak clustering (McDPC). Firstly, based on a widely adopted hypothesis that the potential cluster centers are relatively far away from each other. McDPC obtains centers of the initial micro-clusters (named representative data points) whose minimum distance to the other higher-density data points are relatively larger. Secondly, the representative data points are autonomously categorized into different density levels. Finally, McDPC deals with micro-clusters at each level and if necessary, merges the micro-clusters at a specific level into one cluster to identify multi-center clusters. To evaluate the effectiveness of our proposed McDPC algorithm, we conduct experiments on both synthetic and real-world datasets and benchmark the performance of McDPC against other state-of-the-art clustering algorithms. We also apply McDPC to perform image segmentation and facial recognition to further demonstrate its capability in dealing with real-world applications. The experimental results show that our method achieves promising performance. AI Singapore National Research Foundation (NRF) Accepted version This research is supported by the National Natural Science Foundation of China (61772227,61572227), the Science & Technology Development Foundation of Jilin Province (20180201045GX) and the Social Science Foundation of Education Department of Jilin Province (JJKH20181315SK). This research is also supported, in part, by the National Research Foundation Singapore under its AI Singapore Programme (Award Number: AISG- GC-2019-003), the Singapore Ministry of Health under its National Innovation Challenge on Active and Con dent Ageing (NIC Project No. MOH/NIC/COG04/2017), and the Joint NTU- WeBank Research Centre on Fintech, Nanyang Technological University, Singapore. 2020-10-27T07:15:28Z 2020-10-27T07:15:28Z 2020 Journal Article Wang, Y., Wang, D., Zhang, X., Pang, W., Miao, C., Tan, A.-H., & Zhou, Y. (2020). McDPC : multi-center density peak clustering. Neural Computing and Applications, 32(17), 13465-13478. doi:10.1007/s00521-020-04754-5 0941-0643 https://hdl.handle.net/10356/144300 10.1007/s00521-020-04754-5 17 32 13465 13478 en Neural Computing and Applications © 2020 Springer-Verlag London Limited. This is a post-peer-review, pre-copyedit version of an article published in Neural Computing and Applications. The final authenticated version is available online at: http://dx.doi.org/10.1007/s00521-020-04754-5 application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
language |
English |
topic |
Engineering::Computer science and engineering Density Peak Clustering Image Segmentation |
spellingShingle |
Engineering::Computer science and engineering Density Peak Clustering Image Segmentation Wang, Yizhang Wang, Di Zhang, Xiaofeng Pang, Wei Miao, Chunyan Tan, Ah-Hwee Zhou, You McDPC : multi-center density peak clustering |
description |
Density peak clustering (DPC) is a recently developed density-based clustering algorithm that achieves competitive performance in a non-iterative manner. DPC is capable of effectively handling clusters with single density peak (single center), i.e., based on DPC’s hypothesis, one and only one data point is chosen as the center of any cluster. However, DPC may fail to identify clusters with multiple density peaks (multi-centers) and may not be able to identify natural clusters whose centers have relatively lower local density. To address these limitations, we propose a novel clustering algorithm based on a hierarchical approach, named multi-center density peak clustering (McDPC). Firstly, based on a widely adopted hypothesis that the potential cluster centers are relatively far away from each other. McDPC obtains centers of the initial micro-clusters (named representative data points) whose minimum distance to the other higher-density data points are relatively larger. Secondly, the representative data points are autonomously categorized into different density levels. Finally, McDPC deals with micro-clusters at each level and if necessary, merges the micro-clusters at a specific level into one cluster to identify multi-center clusters. To evaluate the effectiveness of our proposed McDPC algorithm, we conduct experiments on both synthetic and real-world datasets and benchmark the performance of McDPC against other state-of-the-art clustering algorithms. We also apply McDPC to perform image segmentation and facial recognition to further demonstrate its capability in dealing with real-world applications. The experimental results show that our method achieves promising performance. |
author2 |
School of Computer Science and Engineering |
author_facet |
School of Computer Science and Engineering Wang, Yizhang Wang, Di Zhang, Xiaofeng Pang, Wei Miao, Chunyan Tan, Ah-Hwee Zhou, You |
format |
Article |
author |
Wang, Yizhang Wang, Di Zhang, Xiaofeng Pang, Wei Miao, Chunyan Tan, Ah-Hwee Zhou, You |
author_sort |
Wang, Yizhang |
title |
McDPC : multi-center density peak clustering |
title_short |
McDPC : multi-center density peak clustering |
title_full |
McDPC : multi-center density peak clustering |
title_fullStr |
McDPC : multi-center density peak clustering |
title_full_unstemmed |
McDPC : multi-center density peak clustering |
title_sort |
mcdpc : multi-center density peak clustering |
publishDate |
2020 |
url |
https://hdl.handle.net/10356/144300 |
_version_ |
1683493824228229120 |