ORIGINAL RESEARCH article
Front. Appl. Math. Stat.
Sec. Mathematics of Computation and Data Science
Volume 11 - 2025 | doi: 10.3389/fams.2025.1598165
Density peak clustering algorithm based on weighted mutual K-nearest neighbors
Provisionally accepted- 1Yibin University, Yibin, China
- 2Southwest Petroleum University, Chengdu, Sichuan Province, China
Select one of your emails
You have multiple emails registered with Frontiers:
Notify me on publication
Please enter your email address:
If you already have an account, please login
You don't have a Frontiers account ? You can register here
Ever since DPC (Density Peak Clustering) 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 has been 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 Knearest 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 have shown that our algorithm outperforms similar algorithms, demonstrating its superiority. In addition, the WMKNNDPC algorithm has great potential for application in the field of information security, especially in abnormal behavior detection, which can effectively identify abnormal patterns in network traffic and improve the security and reliability of the system.
Keywords: K-nearest neighbors, Inverse K-nearest neighbors, Weighted Mutual K-nearest neighbors, Local density, Remaining points assignment, density peak clustering
Received: 25 Mar 2025; Accepted: 31 Jul 2025.
Copyright: © 2025 Ren, Li, Yu, Yang and Guo. This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) or licensor are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.
* Correspondence:
Chunhua Ren, Yibin University, Yibin, China
Chaorong Li, Yibin University, Yibin, China
Disclaimer: All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article or claim that may be made by its manufacturer is not guaranteed or endorsed by the publisher.