{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T01:26:29Z","timestamp":1773883589355,"version":"3.50.1"},"reference-count":37,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2020,7,14]],"date-time":"2020-07-14T00:00:00Z","timestamp":1594684800000},"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 108-2221-E-155-013"],"award-info":[{"award-number":["MOST 108-2221-E-155-013"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Density peak clustering (DPC) is a density-based clustering method that has attracted much attention in the academic community. DPC works by first searching density peaks in the dataset, and then assigning each data point to the same cluster as its nearest higher-density point. One problem with DPC is the determination of the density peaks, where poor selection of the density peaks could yield poor clustering results. Another problem with DPC is its cluster assignment strategy, which often makes incorrect cluster assignments for data points that are far from their nearest higher-density points. This study modifies DPC and proposes a new clustering algorithm to resolve the above problems. The proposed algorithm uses the radius of the neighborhood to automatically select a set of the likely density peaks, which are far from their nearest higher-density points. Using the potential density peaks as the density peaks, it then applies DPC to yield the preliminary clustering results. Finally, it uses single-linkage clustering on the preliminary clustering results to reduce the number of clusters, if necessary. The proposed algorithm avoids the cluster assignment problem in DPC because the cluster assignments for the potential density peaks are based on single-linkage clustering, not based on DPC. Our performance study shows that the proposed algorithm outperforms DPC for datasets with irregularly shaped clusters.<\/jats:p>","DOI":"10.3390\/sym12071168","type":"journal-article","created":{"date-parts":[[2020,7,22]],"date-time":"2020-07-22T05:10:30Z","timestamp":1595394630000},"page":"1168","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Improving Density Peak Clustering by Automatic Peak Selection and Single Linkage Clustering"],"prefix":"10.3390","volume":"12","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"}]},{"given":"Jen-Chieh","family":"Kuo","sequence":"additional","affiliation":[{"name":"Department of Information Management, Yuan Ze University, Taoyuan 32003, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsing-Wang","family":"Chuang","sequence":"additional","affiliation":[{"name":"Department of Information Management, Yuan Ze University, Taoyuan 32003, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,7,14]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Wang, G., Li, F., Zhang, P., Tian, Y., and Shi, Y. (2009). Data Mining for Customer Segmentation in Personal Financial Market. Proceedings of International Conference on Multiple Criteria Decision Making, Springer.","DOI":"10.1007\/978-3-642-02298-2_90"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1177\/002224378101800305","article-title":"Overlapping Clustering: A New Method for Product Positioning","volume":"18","author":"Arabie","year":"1981","journal-title":"J. Mark. Res."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1016\/j.procs.2015.07.096","article-title":"Image Segmentation via Improving Clustering Algorithms with Density and Distance","volume":"55","author":"Chen","year":"2015","journal-title":"Procedia Comput. Sci."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"2185","DOI":"10.1016\/j.neuroimage.2010.09.074","article-title":"Semi-supervised cluster analysis of imaging data","volume":"54","author":"Filipovych","year":"2011","journal-title":"Neuroimage"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Lowe, R., Shirley, N., Bleackley, M., Dolan, S., and Shafee, T. (2017). Transcriptomics technologies. PLoS Comput. Biol., 13.","DOI":"10.1371\/journal.pcbi.1005457"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"56","DOI":"10.2469\/faj.v36.n6.56","article-title":"Cluster Analysis and Stock Price Comovement","volume":"36","author":"Arnott","year":"1980","journal-title":"Financ. Anal. J."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"2812","DOI":"10.1016\/j.patcog.2015.03.013","article-title":"Kernel methods for point symmetry-based clustering","volume":"48","author":"Cleuziou","year":"2015","journal-title":"Pattern Recognit."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Han, J., Kamber, M., and Pei, J. (2012). 10\u2014Cluster Analysis: Basic Concepts and Methods. Data Mining, Morgan Kaufmann. [3rd ed.].","DOI":"10.1016\/B978-0-12-381479-1.00010-1"},{"key":"ref_9","first-page":"281","article-title":"Some methods for classification and analysis of multivariate observations","volume":"Volume 1","author":"MacQueen","year":"1967","journal-title":"Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability"},{"key":"ref_10","unstructured":"Ester, M., Kriegel, H.-P., Sander, J., and Xu, X. (1996). A density-based algorithm for discovering clusters a density-based algorithm for discovering clusters in large spatial databases with noise. Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, AAAI Press."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Ankerst, M., Breunig, M.M., Kriegel, H.-P., and Sander, J. (1999, January 1\u20133). OPTICS: Ordering points to identify the clustering structure. Proceedings of the 1999 ACM SIGMOD International Conference on Management of Data, Philadelphia, PA, USA.","DOI":"10.1145\/304182.304187"},{"key":"ref_12","unstructured":"Wang, W., Yang, J., and Muntz, R.R. (1997, January 25\u201329). STING: A Statistical Information Grid Approach to Spatial Data Mining. Proceedings of the 23rd International Conference on Very Large Data Bases, San Francisco CA, USA."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1109\/TNN.2005.845141","article-title":"Survey of clustering algorithms","volume":"16","author":"Rui","year":"2005","journal-title":"IEEE Trans. Neural Netw."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s40745-015-0040-1","article-title":"A Comprehensive Survey of Clustering Algorithms","volume":"2","author":"Xu","year":"2015","journal-title":"Ann. Data Sci."},{"key":"ref_15","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_16","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_17","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_18","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_19","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_20","doi-asserted-by":"crossref","first-page":"1713801","DOI":"10.1155\/2019\/1713801","article-title":"A Density Peak Clustering Algorithm Based on the K-Nearest Shannon Entropy and Tissue-Like P System","volume":"2019","author":"Jiang","year":"2019","journal-title":"Math. Probl. Eng."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"2032461","DOI":"10.1155\/2018\/2032461","article-title":"A Novel Hierarchical Clustering Algorithm Based on Density Peaks for Complex Datasets","volume":"2018","author":"Zhou","year":"2018","journal-title":"Complexity"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Liu, Y., Liu, D., Yu, F., and Ma, Z. (2020). A Double-Density Clustering Method Based on \u201cNearest to First in\u201d Strategy. Symmetry, 12.","DOI":"10.3390\/sym12050747"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Li, Z., and Tang, Y. (2017). Comparative Density Peaks Clustering. Expert Syst. Appl.","DOI":"10.1016\/j.eswa.2017.11.020"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"2125","DOI":"10.1093\/bioinformatics\/bty932","article-title":"Clusterdv: A simple density-based clustering method that is robust, general and automatic","volume":"35","author":"Marques","year":"2018","journal-title":"Bioinformatics"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"4724150","DOI":"10.1155\/2020\/4724150","article-title":"Automatic Determination of Clustering Centers for \u201cClustering by Fast Search and Find of Density Peaks\u201d","volume":"2020","author":"Min","year":"2020","journal-title":"Math. Probl. Eng."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Ruan, S., El-Ashram, S., Mahmood, Z., Mehmood, R., and Ahmad, W. (2016, January 20\u201321). Density Peaks Clustering for Complex Datasets. Proceedings of the 2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI), Beijing, China.","DOI":"10.1109\/IIKI.2016.20"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Wang, Y., Wang, D., Zhang, X., Pang, W., Miao, C., Tan, A.-H., and Zhou, Y. (2020). McDPC: Multi-center density peak clustering. Neural Comput. Appl.","DOI":"10.1007\/s00521-020-04754-5"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Lin, J.-L. (2019). Accelerating Density Peak Clustering Algorithm. Symmetry, 11.","DOI":"10.3390\/sym11070859"},{"key":"ref_29","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_30","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/j.patrec.2019.10.019","article-title":"Fast and general density peaks clustering","volume":"128","author":"Sieranoja","year":"2019","journal-title":"Pattern Recognit. Lett."},{"key":"ref_31","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 Bioinform., 8.","DOI":"10.1186\/1471-2105-8-3"},{"key":"ref_32","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_33","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_34","unstructured":"K\u00e4rkk\u00e4inen, I., and Fr\u00e4nti, P. (2002). Dynamic Local Search Algorithm for the Clustering Problem, University of Joensuu. A-2002-6."},{"key":"ref_35","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_36","unstructured":"Jain, A.K., and Law, M.H. (2005, January 20\u201322). Data clustering: A user\u2019s dilemma. Proceedings of the 2005 International Conference on Pattern Recognition and Machine Intelligence, Kolkata, India."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s00454-004-1146-y","article-title":"Computing persistent homology","volume":"33","author":"Zomorodian","year":"2005","journal-title":"Discret. Comput. Geom."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/12\/7\/1168\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T09:51:14Z","timestamp":1760176274000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/12\/7\/1168"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,14]]},"references-count":37,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2020,7]]}},"alternative-id":["sym12071168"],"URL":"https:\/\/doi.org\/10.3390\/sym12071168","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,14]]}}}