{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:41:04Z","timestamp":1760240464241,"version":"build-2065373602"},"reference-count":30,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2019,7,2]],"date-time":"2019-07-02T00:00:00Z","timestamp":1562025600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST 106-2221-E-155-038"],"award-info":[{"award-number":["MOST 106-2221-E-155-038"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>The Density Peak Clustering (DPC) algorithm is a new density-based clustering method. It spends most of its execution time on calculating the local density and the separation distance for each data point in a dataset. The purpose of this study is to accelerate its computation. On average, the DPC algorithm scans half of the dataset to calculate the separation distance of each data point. We propose an approach to calculate the separation distance of a data point by scanning only the neighbors of the data point. Additionally, the purpose of the separation distance is to assist in choosing the density peaks, which are the data points with both high local density and high separation distance. We propose an approach to identify non-peak data points at an early stage to avoid calculating their separation distances. Our experimental results show that most of the data points in a dataset can benefit from the proposed approaches to accelerate the DPC algorithm.<\/jats:p>","DOI":"10.3390\/sym11070859","type":"journal-article","created":{"date-parts":[[2019,7,2]],"date-time":"2019-07-02T12:11:17Z","timestamp":1562069477000},"page":"859","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Accelerating Density Peak Clustering Algorithm"],"prefix":"10.3390","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6844-1182","authenticated-orcid":false,"given":"Jun-Lin","family":"Lin","sequence":"first","affiliation":[{"name":"Department of Information Management, Yuan Ze University, Taoyuan 32003, Taiwan"},{"name":"Innovation Center for Big Data and Digital Convergence, Yuan Ze University, Taoyuan 32003, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,7,2]]},"reference":[{"key":"ref_1","unstructured":"Aggarwal, C.C., and Reddy, C.K. (2014). Data Clustering: Algorithms and Applications, Chapman and Hall\/CRC."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Pham, G., Lee, S.-H., Kwon, O.-H., and Kwon, K.-R. (2018). A watermarking method for 3d printing based on menger curvature and k-mean clustering. Symmetry, 10.","DOI":"10.3390\/sym10040097"},{"key":"ref_3","unstructured":"MacQueen, J. (1965, January 18\u201321). Some methods for classification and analysis of multivariate observations. Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Berkeley, CA, USA."},{"key":"ref_4","first-page":"226","article-title":"A density-based algorithm for discovering clusters a density-based algorithm for discovering clusters in large spatial databases with noise","volume":"96","author":"Ester","year":"1996","journal-title":"KDD"},{"key":"ref_5","unstructured":"Han, J., Kamber, M., and Pei, J. (2011). Data Mining: Concepts and Techniques, Morgan Kaufmann Publishers Inc."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1492","DOI":"10.1126\/science.1242072","article-title":"Clustering by fast search and find of density peaks","volume":"344","author":"Rodriguez","year":"2014","journal-title":"Science"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.neucom.2016.01.102","article-title":"Clustering by fast search and find of density peaks via heat diffusion","volume":"208","author":"Mehmood","year":"2016","journal-title":"Neurocomputing"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1049\/cje.2016.05.001","article-title":"Clustering by fast search and find of density peaks with data field","volume":"25","author":"Wang","year":"2016","journal-title":"Chin. J. Electron."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/j.patcog.2017.06.023","article-title":"Fast density clustering strategies based on the k-means algorithm","volume":"71","author":"Bai","year":"2017","journal-title":"Pattern Recognit."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"45602","DOI":"10.1038\/srep45602","article-title":"Clustering by fast search and merge of local density peaks for gene expression microarray data","volume":"7","author":"Mehmood","year":"2017","journal-title":"Sci. Rep."},{"key":"ref_11","first-page":"7","article-title":"Clustering mixed data by fast search and find of density peaks","volume":"2017","author":"Liu","year":"2017","journal-title":"Math. Probl. Eng."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.eswa.2017.11.020","article-title":"Comparative density peaks clustering","volume":"95","author":"Li","year":"2018","journal-title":"Expert Syst. Appl."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/j.knosys.2016.02.001","article-title":"Study on density peaks clustering based on k-nearest neighbors and principal component analysis","volume":"99","author":"Du","year":"2016","journal-title":"Knowl.-Based Syst."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/j.knosys.2017.07.010","article-title":"Adaptive density peak clustering based on k-nearest neighbors with aggregating strategy","volume":"133","author":"Yaohui","year":"2017","journal-title":"Knowl.-Based Syst."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1016\/j.knosys.2017.07.027","article-title":"An entropy-based density peaks clustering algorithm for mixed type data employing fuzzy neighborhood","volume":"133","author":"Ding","year":"2017","journal-title":"Knowl.-Based Syst."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/j.patrec.2017.10.025","article-title":"Parameter-free laplacian centrality peaks clustering","volume":"100","author":"Yang","year":"2017","journal-title":"Pattern Recognit. Lett."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Cheng, S., Duan, Y., Fan, X., Zhang, D., and Cheng, H. (2017). Review of Fast Density-Peaks Clustering and Its Application to Pediatric White Matter Tracts. Annual Conference on Medical Image Understanding and Analysis, Springer International Publishing.","DOI":"10.1007\/978-3-319-60964-5_38"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Han, J., Kamber, M., and Pei, J. (2012). 10-cluster analysis: Basic concepts and methods. Data Mining, Morgan Kaufmann. [3rd ed.].","DOI":"10.1016\/B978-0-12-381479-1.00010-1"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1109\/TFUZZ.2015.2486806","article-title":"A novel adaptive possibilistic clustering algorithm","volume":"24","author":"Xenaki","year":"2016","journal-title":"IEEE Trans. Fuzzy Syst."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1007\/s11590-015-0980-6","article-title":"A min-cut approach to functional regionalization, with a case study of the italian local labour market areas","volume":"10","author":"Bianchi","year":"2016","journal-title":"Optim. Lett."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.ins.2016.01.101","article-title":"A survey on soft subspace clustering","volume":"348","author":"Deng","year":"2016","journal-title":"Inf. Sci."},{"key":"ref_22","unstructured":"Laio, A. (2019, May 27). Matlab Implementation of the Density Peak Algorithm. Available online: http:\/\/people.sissa.it\/~laio\/Research\/Clustering_source_code\/cluster_dp.tgz."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/j.patcog.2007.04.010","article-title":"Robust path-based spectral clustering","volume":"41","author":"Chang","year":"2008","journal-title":"Pattern Recognit."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Fu, L., and Medico, E. (2007). Flame, a novel fuzzy clustering method for the analysis of DNA microarray data. BMC Bioinf., 8.","DOI":"10.1186\/1471-2105-8-3"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/1217299.1217303","article-title":"Clustering aggregation","volume":"1","author":"Gionis","year":"2007","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1109\/TPAMI.2002.1033218","article-title":"A maximum variance cluster algorithm","volume":"24","author":"Veenman","year":"2002","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_27","unstructured":"K\u00e4rkk\u00e4inen, I., and Fr\u00e4nti, P. (2002). Dynamic Local Search Algorithm for the Clustering Problem, University of Joensuu."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1016\/j.patcog.2005.09.012","article-title":"Iterative shrinking method for clustering problems","volume":"39","author":"Virmajoki","year":"2006","journal-title":"Pattern Recognit."},{"key":"ref_29","unstructured":"Lin, J., Peng, H., Xie, J., and Zheng, Q. (2004, January 26\u201329). Novel clustering algorithm based on central symmetry. Proceedings of the Internation Conference on Machine Learning and Cybernetics, Shanghai, China."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"1441","DOI":"10.1109\/TKDE.2008.79","article-title":"A Point Symmetry-Based Clustering Technique for Automatic Evolution of Clusters","volume":"20","author":"Bandyopadhyay","year":"2008","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/11\/7\/859\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:01:57Z","timestamp":1760187717000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/11\/7\/859"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,2]]},"references-count":30,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2019,7]]}},"alternative-id":["sym11070859"],"URL":"https:\/\/doi.org\/10.3390\/sym11070859","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2019,7,2]]}}}