{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T03:12:40Z","timestamp":1777605160827,"version":"3.51.4"},"reference-count":49,"publisher":"Frontiers Media SA","license":[{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["frontiersin.org"],"crossmark-restriction":true},"short-container-title":["Front. Appl. Math. Stat."],"abstract":"<jats:p>Ever since Density Peak Clustering (DPC) was published in Science, it has been widely favored and applied in various fields due to its concise and efficient computational theory. However, DPC has two major flaws. On the one hand, it fails to find cluster centers of low-density clusters in datasets with uneven density distribution. On the other hand, its single assignment strategy, which only assigns points to high-density clusters, can lead to incorrect clustering due to a chain reaction. To address these weaknesses, a new density peak clustering algorithm based on weighted mutual K-nearest neighbors called WMKNNDPC is proposed in this paper. WMKNNDPC offers two significant advantages: (1) It introduces the concept of mutual K-nearest neighbors by using K-nearest neighbors and inverse K-nearest neighbors, allowing for the identification of cluster centers in clusters with uneven density distribution through a new local density calculation method. (2) It includes a remaining points assignment method based on weighted mutual K-nearest neighbors, which involves two stages: first, the initial assignment of data points is done by combining mutual K-nearest neighbors and breadth-first search, and second, the membership degree of data points is calculated based on weighted mutual K-nearest neighbors for remaining points assignment. This method allows for efficient assignment based on the local distribution of points, avoiding the disadvantages of using a fixed K-value in DPC-derived algorithms based on K-nearest neighbors. The WMKNNDPC algorithm has been extensively tested on two-dimensional synthetic datasets, real datasets, facial recognition dataset and parameter analysis. The experimental results indicate that our algorithm performs the best on most datasets.<\/jats:p>","DOI":"10.3389\/fams.2025.1598165","type":"journal-article","created":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T04:14:05Z","timestamp":1756700045000},"update-policy":"https:\/\/doi.org\/10.3389\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Density peak clustering algorithm based on weighted mutual K-nearest neighbors"],"prefix":"10.3389","volume":"11","author":[{"given":"Chunhua","family":"Ren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chaorong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wanan","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruiqi","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1965","published-online":{"date-parts":[[2025,9,1]]},"reference":[{"key":"B1","doi-asserted-by":"publisher","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":"B2","doi-asserted-by":"publisher","first-page":"106731","DOI":"10.1016\/j.knosys.2020.106731","article-title":"A unified form of fuzzy C-means and K-means algorithms and its partitional implementation","volume":"214","author":"Borlea","year":"2021","journal-title":"Knowl-Based Syst"},{"key":"B3","doi-asserted-by":"publisher","first-page":"e1219","DOI":"10.1002\/widm.1219","article-title":"Algorithms for hierarchical clustering: an overview, II","volume":"7","author":"Murtagh","year":"2017","journal-title":"Wiley Interdiscip Rev: Data Min Knowl Discov"},{"key":"B4","doi-asserted-by":"publisher","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":"B5","doi-asserted-by":"publisher","first-page":"e5567","DOI":"10.1002\/cpe.5567","article-title":"Density peaks clustering based on circular partition and grid similarity","volume":"32","author":"Zhao","year":"2019","journal-title":"Concurr Comput Pract Exp"},{"key":"B6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2018.12.059","article-title":"Unsupervised fuzzy model-based Gaussian clustering","volume":"481","author":"Yang","year":"2019","journal-title":"Inf Sci"},{"key":"B7","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/3097983.3098069","article-title":"Local higher-order graph clustering","volume-title":"Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"Yin","year":"2017"},{"key":"B8","doi-asserted-by":"publisher","first-page":"107924","DOI":"10.1016\/j.asoc.2021.107924","article-title":"Customer segmentation using K-means clustering and the adaptive particle swarm optimization algorithm","volume":"113","author":"Li","year":"2021","journal-title":"Appl Soft Comput"},{"key":"B9","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1016\/j.inffus.2022.11.008","article-title":"Application of belief functions to medical image segmentation: a review","volume":"91","author":"Huang","year":"2023","journal-title":"Inf Fusion"},{"key":"B10","doi-asserted-by":"publisher","first-page":"2078","DOI":"10.1109\/TFUZZ.2019.2930030","article-title":"Automatic fuzzy clustering framework for image segmentation","volume":"28","author":"Lei","year":"2019","journal-title":"IEEE Trans Fuzzy Syst"},{"key":"B11","doi-asserted-by":"publisher","first-page":"5085","DOI":"10.1109\/TGRS.2019.2896471","article-title":"Spatial density peak clustering for hyperspectral image classification with noisy labels","volume":"57","author":"Tu","year":"2019","journal-title":"IEEE Trans Geosci Remote Sens"},{"key":"B12","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1007\/s10586-020-03171-6","article-title":"Robust product recommendation system using modified grey wolf optimizer and quantum inspired possibilistic fuzzy C-means","volume":"24","author":"Kolhe","year":"2021","journal-title":"Cluster Comput"},{"key":"B13","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.ins.2014.09.041","article-title":"Greedy discrete particle swarm optimization for large-scale social network clustering","volume":"316","author":"Cai","year":"2015","journal-title":"Inf Sci"},{"key":"B14","doi-asserted-by":"publisher","first-page":"4767","DOI":"10.1109\/TKDE.2022.3150403","article-title":"Fast LDP-MST: an efficient density-peak-based clustering method for large-size datasets","volume":"35","author":"Qiu","year":"2023","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"B15","doi-asserted-by":"publisher","first-page":"2036","DOI":"10.3390\/pr11072036","article-title":"A fast density peak clustering method for power data security detection based on local outlier factors","volume":"11","author":"Lv","year":"2023","journal-title":"Processes"},{"key":"B16","doi-asserted-by":"publisher","first-page":"3433","DOI":"10.1109\/TKDE.2022.3155450","article-title":"An effective and efficient algorithm for K-means clustering with new formulation","volume":"35","author":"Nie","year":"2022","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"B17","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","volume-title":"Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD'96)","author":"Ester","year":"1996"},{"key":"B18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3068335","article-title":"DBSCAN revisited, revisited: why and how you should (still) use DBSCAN","volume":"42","author":"Schubert","year":"2017","journal-title":"ACM Trans Database Syst"},{"key":"B19","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.patrec.2016.12.023","article-title":"A global-local affinity matrix model via EigenGap for graph-based subspace clustering","volume":"89","author":"Shi","year":"2017","journal-title":"Pattern Recognit Lett"},{"key":"B20","doi-asserted-by":"publisher","first-page":"107836","DOI":"10.1016\/j.patcog.2021.107836","article-title":"A new EM algorithm for flexibly tied GMMs with large number of components","volume":"114","author":"Asheri","year":"2021","journal-title":"Pattern Recognit"},{"key":"B21","doi-asserted-by":"publisher","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":"B22","doi-asserted-by":"publisher","first-page":"1883","DOI":"10.4249\/scholarpedia.1883","article-title":"K-nearest neighbor","volume":"4","author":"Peterson","year":"2009","journal-title":"Scholarpedia"},{"key":"B23","doi-asserted-by":"publisher","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":"B24","doi-asserted-by":"publisher","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":"B25","doi-asserted-by":"publisher","first-page":"123449","DOI":"10.1109\/ACCESS.2020.3006069","article-title":"Effective density peaks clustering algorithm based on the layered k-nearest neighbors and subcluster merging","volume":"8","author":"Ren","year":"2020","journal-title":"IEEE Access"},{"key":"B26","doi-asserted-by":"publisher","first-page":"60684","DOI":"10.1109\/ACCESS.2019.2912332","article-title":"Efficient clustering method based on density peaks with symmetric neighborhood relationship","volume":"7","author":"Wu","year":"2019","journal-title":"IEEE Access"},{"key":"B27","doi-asserted-by":"publisher","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":"B28","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/IJCNN.2016.7727185","article-title":"Natural neighbor-based clustering algorithm with density peeks","volume-title":"2016 International Joint Conference on Neural Networks (IJCNN)","author":"Cheng","year":"2016"},{"key":"B29","doi-asserted-by":"publisher","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":"B30","doi-asserted-by":"publisher","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":"B31","doi-asserted-by":"publisher","first-page":"5171","DOI":"10.1007\/s00500-018-3183-0","article-title":"A feasible density peaks clustering algorithm with a merging strategy","volume":"23","author":"Xu","year":"2019","journal-title":"Soft Comput"},{"key":"B32","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.neucom.2018.06.087","article-title":"REDPC: a residual error-based density peak clustering algorithm","volume":"348","author":"Parmar","year":"2019","journal-title":"Neurocomputing"},{"key":"B33","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1016\/j.neucom.2020.02.119","article-title":"A systematic density-based clustering method using anchor points","volume":"400","author":"Wang","year":"2020","journal-title":"Neurocomputing"},{"key":"B34","doi-asserted-by":"publisher","first-page":"10141","DOI":"10.1007\/s00521-021-05777-2","article-title":"Relative density-based clustering algorithm for identifying diverse density clusters effectively","volume":"33","author":"Wang","year":"2021","journal-title":"Neural Comput Appl"},{"key":"B35","doi-asserted-by":"publisher","first-page":"116539","DOI":"10.1016\/j.eswa.2022.116539","article-title":"A graph adaptive density peaks clustering algorithm for automatic centroid selection and effective aggregation","volume":"195","author":"Xu","year":"2022","journal-title":"Expert Syst Appl"},{"key":"B36","doi-asserted-by":"publisher","first-page":"109406","DOI":"10.1016\/j.patcog.2023.109406","article-title":"Density peaks clustering algorithm based on fuzzy and weighted shared neighbor for uneven density datasets","volume":"139","author":"Zhao","year":"2023","journal-title":"Pattern Recognit"},{"key":"B37","doi-asserted-by":"publisher","first-page":"119788","DOI":"10.1016\/j.ins.2023.119788","article-title":"SFKNN-DPC: standard deviation weighted distance based density peak clustering algorithm","volume":"653","author":"Xie","year":"2024","journal-title":"Inf Sci"},{"key":"B38","doi-asserted-by":"publisher","first-page":"111748","DOI":"10.1016\/j.knosys.2024.111748","article-title":"ANN-DPC: density peak clustering by finding the adaptive nearest neighbors","volume":"294","author":"Yan","year":"2024","journal-title":"Knowl-Based Syst"},{"key":"B39","doi-asserted-by":"publisher","first-page":"1179","DOI":"10.1007\/s13042-019-01031-3","article-title":"Mk-NNG-DPC: density peaks clustering based on improved mutual K-nearest-neighbor graph","volume":"11","author":"Fan","year":"2019","journal-title":"Int J Mach Learn Cybern"},{"key":"B40","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.ins.2023.119470","article-title":"Fast density peaks clustering algorithm based on improved mutual K-nearest-neighbor and sub-cluster merging","volume":"647","author":"Li","year":"2023","journal-title":"Inf Sci"},{"key":"B41","doi-asserted-by":"publisher","first-page":"34301","DOI":"10.1109\/ACCESS.2019.2904254","article-title":"Density peaks clustering based on weighted local density sequence and nearest neighbor assignment","volume":"7","author":"Yu","year":"2019","journal-title":"IEEE Access"},{"key":"B42","doi-asserted-by":"publisher","first-page":"21","DOI":"10.3233\/JIFS-202449","article-title":"Density peaks clustering based on local fair density and fuzzy k-nearest neighbors membership allocation strategy","volume":"43","author":"Ren","year":"2022","journal-title":"J Intell Fuzzy Syst"},{"key":"B43","doi-asserted-by":"publisher","first-page":"121860","DOI":"10.1016\/j.eswa.2023.121860","article-title":"Density peak clustering algorithms: a review on the decade 2014-2023","volume":"238","author":"Wang","year":"2024","journal-title":"Expert Syst Appl"},{"key":"B44","unstructured":"Dua\n              D\n            \n            \n              Graff\n              C\n            \n          \n          Irvine, CA\n          University of California, School of Information and Computer Sciences\n          UCI Machine Learning Repository\n          \n          2017"},{"key":"B45","doi-asserted-by":"publisher","first-page":"3034","DOI":"10.1016\/j.patcog.2014.03.017","article-title":"Centroid index: cluster level similarity measure","volume":"47","author":"Fr\u00e4nti","year":"2014","journal-title":"Pattern Recognit"},{"key":"B46","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":"B47","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s13748-020-00209-z","article-title":"Gabriel graph-based connectivity and density for internal validity of clustering","volume":"9","author":"Boudane","year":"2020","journal-title":"Prog Artif Intell"},{"key":"B48","unstructured":"Cambridge\n              AL\n            \n          \n          The Database of Faces\n          \n          1992"},{"key":"B49","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.ins.2022.12.078","article-title":"An improved density peaks clustering algorithm based on natural neighbor with a merging strategy","volume":"624","author":"Ding","year":"2023","journal-title":"Inf Sci"}],"container-title":["Frontiers in Applied Mathematics and Statistics"],"original-title":[],"link":[{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fams.2025.1598165\/full","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T09:04:40Z","timestamp":1757063080000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fams.2025.1598165\/full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,1]]},"references-count":49,"alternative-id":["10.3389\/fams.2025.1598165"],"URL":"https:\/\/doi.org\/10.3389\/fams.2025.1598165","relation":{},"ISSN":["2297-4687"],"issn-type":[{"value":"2297-4687","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,1]]},"article-number":"1598165"}}