{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T16:11:00Z","timestamp":1762272660307,"version":"build-2065373602"},"reference-count":42,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2020,12,6]],"date-time":"2020-12-06T00:00:00Z","timestamp":1607212800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>The clustering analysis algorithm is used to reveal the internal relationships among the data without prior knowledge and to further gather some data with common attributes into a group. In order to solve the problem that the existing algorithms always need prior knowledge, we proposed a fast searching density peak clustering algorithm based on the shared nearest neighbor and adaptive clustering center (DPC-SNNACC) algorithm. It can automatically ascertain the number of knee points in the decision graph according to the characteristics of different datasets, and further determine the number of clustering centers without human intervention. First, an improved calculation method of local density based on the symmetric distance matrix was proposed. Then, the position of knee point was obtained by calculating the change in the difference between decision values. Finally, the experimental and comparative evaluation of several datasets from diverse domains established the viability of the DPC-SNNACC algorithm.<\/jats:p>","DOI":"10.3390\/sym12122014","type":"journal-article","created":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T22:15:36Z","timestamp":1607638536000},"page":"2014","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Fast Searching Density Peak Clustering Algorithm Based on Shared Nearest Neighbor and Adaptive Clustering Center"],"prefix":"10.3390","volume":"12","author":[{"given":"Yi","family":"Lv","sequence":"first","affiliation":[{"name":"Key Laboratory of Advanced Control and Optimization for Chemical Processes, Ministry of Education, East China University of Science and Technology, Shanghai 200237, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5928-4656","authenticated-orcid":false,"given":"Mandan","family":"Liu","sequence":"additional","affiliation":[{"name":"Key Laboratory of Advanced Control and Optimization for Chemical Processes, Ministry of Education, East China University of Science and Technology, Shanghai 200237, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue","family":"Xiang","sequence":"additional","affiliation":[{"name":"Key Laboratory of Advanced Control and Optimization for Chemical Processes, Ministry of Education, East China University of Science and Technology, Shanghai 200237, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,12,6]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1109\/TNN.2005.845141","article-title":"Survey of Clustering Algorithms","volume":"16","author":"Xu","year":"2005","journal-title":"IEEE Trans. Neural Netw."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"583","DOI":"10.3233\/IDA-2007-11602","article-title":"An overview of clustering methods","volume":"11","author":"Omran","year":"2007","journal-title":"Intell. Data Anal."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1137\/18M1209854","article-title":"Turning Big Data into Tiny Data: Constant-Size Coresets for kk-Means, PCA, and Projective Clustering","volume":"49","author":"Feldman","year":"2020","journal-title":"SIAM J. Comput."},{"key":"ref_4","first-page":"6191","article-title":"Machine learning. Clustering by fast search and find of density peaks","volume":"344","author":"Alex","year":"2014","journal-title":"J. Sci."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1186\/s13018-015-0302-9","article-title":"Study of transpedicular screw fixation on spine development in a piglet model","volume":"11","author":"Shi","year":"2016","journal-title":"J. Orthop. Surg. Res."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"2877","DOI":"10.1007\/s11042-015-2485-9","article-title":"A new method to estimate ages of facial image for large database","volume":"75","author":"Chen","year":"2015","journal-title":"Multimed. Tools Appl."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.ins.2018.03.031","article-title":"Shared-nearest-neighbor-based clustering by fast search and find of density peaks","volume":"450","author":"Liu","year":"2018","journal-title":"Inf. Sci."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1718","DOI":"10.1109\/ACCESS.2017.2780109","article-title":"From Partition-Based Clustering to Density-Based Clustering: Fast Find Clusters With Diverse Shapes and Densities in Spatial Databases","volume":"6","author":"Wang","year":"2017","journal-title":"IEEE Access"},{"key":"ref_9","unstructured":"Kaufman, L., and Rousseeuw, P.J. (2008). Partitioning Around Medoids (Program PAM), Wiley."},{"key":"ref_10","unstructured":"Kaufman, L., and Rousseeuw, P.J. (2005). Finding Groups in Data: An Introduction to Cluster Analysis, Wiley."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1003","DOI":"10.1109\/TKDE.2002.1033770","article-title":"CLARANS: A method for clustering objects for spatial data mining","volume":"14","author":"Ng","year":"2002","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1126\/science.1136800","article-title":"Clustering by Passing Messages between Data Points","volume":"315","author":"Frey","year":"2007","journal-title":"Science"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Zhang, T., Ramakrishnan, R., and Livny, M. (1996). BIRCH: An Efficient Data Clustering Method for Very Large Databases. ACM SIGMOD Rec., 25.","DOI":"10.1145\/235968.233324"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/S0306-4379(00)00022-3","article-title":"A Clustering Algorithm for Categorical Attributes","volume":"25","author":"Guha","year":"1999","journal-title":"Inf. Syst. J."},{"key":"ref_15","unstructured":"Wang, W., Yang, J., and Muntz, R. (1997, January 25\u201329). In STING: A Statistical Information Grid Approach to Spatial Data Mining. Proceedings of the VLDB\u201997\u201423rd International Conference on Very Large Data Bases, Athens, Greece."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Gehrke, J.E., Gunopulos, D., and Raghavan, P. (1998, January 1\u20134). Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications. Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, Seattle, WA, USA.","DOI":"10.1145\/276304.276314"},{"key":"ref_17","unstructured":"Ester, M. (1996). A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise, AAAI Press."},{"key":"ref_18","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_19","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.patrec.2016.01.009","article-title":"Delta-density based clustering with a divide-and-conquer strategy: 3DC clustering","volume":"73","author":"Liang","year":"2016","journal-title":"Pattern Recognit. Lett."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.ins.2016.03.011","article-title":"Robust clustering by detecting density peaks and assigning points based on fuzzy weighted K-nearest neighbors","volume":"354","author":"Xie","year":"2016","journal-title":"Inf. Sci."},{"key":"ref_21","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_22","doi-asserted-by":"crossref","unstructured":"Qi, J., Xiao, B., and Chen, Y. (2018, January 25\u201327). I-CFSFDP: A Robust and High Accuracy Clustering Method Based on CFSFDP. Proceedings of the 37th Chinese Control Conference (CCC), Wuhan, China.","DOI":"10.23919\/ChiCC.2018.8482745"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Liu, Y., Liu, D., Yu, F., and Ma, Z. (2020). A Double-Density Clustering Method Based on Nearest to First in Strategy. Symmetry, 12.","DOI":"10.3390\/sym12050747"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1007\/s00779-016-0954-4","article-title":"Adaptive fuzzy clustering by fast search and find of density peaks","volume":"20","author":"Bie","year":"2016","journal-title":"Pers. Ubiquitous Comput."},{"key":"ref_25","first-page":"1614","article-title":"Density Peaks Clustering by Automatic Determination of Cluster Centers","volume":"10","author":"Tao","year":"2016","journal-title":"J. Front. Comput. Sci. Technol."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Lin, J.-L., Kuo, J.-C., and Chuang, H.-W. (2020). Improving Density Peak Clustering by Automatic Peak Selection and Single Linkage Clustering. Symmetry, 12.","DOI":"10.3390\/sym12071168"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"342","DOI":"10.4028\/www.scientific.net\/AMM.155-156.342","article-title":"An Efficient Distance and Density Based Outlier Detection Approach","volume":"155","author":"Zhong","year":"2012","journal-title":"Appl. Mech. Mater."},{"key":"ref_28","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_29","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_30","doi-asserted-by":"crossref","unstructured":"Jain, A.K., and Law, M. (2005, January 20\u201322). Data Clustering: A User\u2019s Dilemma. Proceedings of the International Conference on Pattern Recognition and Machine Intelligence, Kolkata, India.","DOI":"10.1007\/11590316_1"},{"key":"ref_31","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_32","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1108\/03056120710836882","article-title":"Mechanical drilling of printed circuit boards: The state-of-the-art","volume":"33","author":"Fu","year":"2007","journal-title":"Circuit World"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Xia, Y., Wang, G., and Gao, S. (2007, January 26\u201328). An Efficient Clustering Algorithm for 2D Multi-density Dataset in Large Database. Proceedings of the 2007 International Conference on Multimedia and Ubiquitous Engineering (MUE\u201907), Seoul, Korea.","DOI":"10.1109\/MUE.2007.67"},{"key":"ref_34","unstructured":"Bache, K., and Lichman, M. (2013). UCI Machine Learning Repository, University of California."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Charytanowicz, M., Niewczas, J., Kulczycki, P., Kowalski, P.A., \u0141ukasik, S., and \u017bak, S. (2010). Complete Gradient Clustering Algorithm for Features Analysis of X-ray Images, Springer.","DOI":"10.1007\/978-3-642-13105-9_2"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1117\/12.148698","article-title":"Nuclear Feature Extraction for Breast Tumor Diagnosis","volume":"Volume 1905","author":"Street","year":"1993","journal-title":"Biomedical Image Processing and Biomedical Visualization"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"033015","DOI":"10.1088\/1367-2630\/11\/3\/033015","article-title":"Detecting the overlapping and hierarchical community structure in complex networks","volume":"11","author":"Lancichinetti","year":"2009","journal-title":"New J. Phys."},{"key":"ref_38","first-page":"2837","article-title":"Information Theoretic Measures for Clusterings Comparison: Variants, Properties, Normalization and Correction for Chance","volume":"11","author":"Vinh","year":"2010","journal-title":"J. Mach. Learn. Res."},{"key":"ref_39","unstructured":"Yan, Y., Fan, J., and Mohamed, K. (2008). Survey of clustering validity evaluation. Appl. Res. Comput."},{"key":"ref_40","first-page":"2037","article-title":"Spectral Clustering Algorithm Based on Adaptive Nystrom Sampling for Big Data Analysis","volume":"25","author":"Ding","year":"2014","journal-title":"J. Softw."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1080\/01621459.1983.10478008","article-title":"A Method for Comparing Two Hierarchical Clusterings","volume":"78","author":"Fowlkes","year":"1983","journal-title":"J. Am. Stat. Assoc."},{"key":"ref_42","unstructured":"Jiawei, H., and Micheline, K. (2006). Data Mining: Concepts and Techniques, Elsevier."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/12\/12\/2014\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T10:41:33Z","timestamp":1760179293000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/12\/12\/2014"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,6]]},"references-count":42,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2020,12]]}},"alternative-id":["sym12122014"],"URL":"https:\/\/doi.org\/10.3390\/sym12122014","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2020,12,6]]}}}