Abstract
As a relatively novel density-based clustering algorithm, Density peak clustering (DPC) has been widely studied in recent years. DPC sorts all points in descending order of local density and finds neighbors for each point in turn to assign all points to the appropriate clusters. The algorithm is simple and effective but has some limitations in applicable scenarios. If the density difference between clusters is large or the data distribution is in a nested structure, the clustering effect of this algorithm is poor. This study incorporates the idea of connectivity into the original algorithm and proposes an improved density peak clustering algorithm ConDPC. ConDPC modifies the strategy of obtaining clustering center points and assigning neighbors and improves the clustering accuracy of the original density peak clustering algorithm. In this study, clustering comparison experiments were conducted on synthetic data sets and real-world data sets. The compared algorithms include original DPC, DBSCAN, K-means and two improved algorithms over DPC. The comparison results prove the effectiveness of ConDPC.
Funder
China Postdoctoral Science Foundation
the natural science project for colleges and universities in Jiangsu Province
Subject
Fluid Flow and Transfer Processes,Computer Science Applications,Process Chemistry and Technology,General Engineering,Instrumentation,General Materials Science
Reference35 articles.
1. Data clustering: 50 years beyond K-means;Jain;Pattern Recognit. Lett.,2010
2. Han, J., Kamber, M., and Pei, J. (2011). Data Mining: Concepts and Techniques, Morgan Kaufmann. [3rd ed.].
3. Density-ratio based clustering for discovering clusters with varying densities;Zhu;Pattern Recognit.,2016
4. An improved seed point selection-based unsupervised color clustering for content-based image retrieval application;Pavithra;Comp. J.,2019
5. Sun, Z., Qi, M., Lian, J., Jia, W., Zou, W., He, Y., Liu, H., and Zheng, Y. (2018). Image Segmentation by Searching for Image Feature Density Peaks. Appl. Sci., 8.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献