Papers › Autonomous clustering by fast find of mass and distance peaks
Autonomous clustering by fast find of mass and distance peaks
Jie Yang, Chin-Teng Lin, University of Technology Sydney
Clustering is a fundamental tool of scientific analysis, ubiquitous in disciplines from biology and chemistry to astronomy and pattern recognition. We propose a novel clustering algorithm based on the natural idea that a cluster and its nearest neighbor with higher mass should be merged into one cluster, unless they both have relatively large masses and the distance between them is also relatively large. The find of mass and distance peaks reveals the mergers that don’t conform to the rule and should be removed. The algorithm is parameter-free and harnesses this idea to recognize any cluster and find the proper number of clusters and noise autonomously. Experiments on numerous synthetic and real-world data sets show the enormous versatility of the proposed algorithm that remarkably outperforms the best compared algorithm. Additionally, we also compare it with latest state-of-the-art deep clustering algorithms on several challenging image data sets. The proposed algorithm without any deep representation achieves better or close performance than deep clustering algorithms on image clustering.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections