


























Abstract:We present \textit{CluProp}, a novel framework that reimagines varied-density clustering in high-dimensional spaces as a label propagation process over neighborhood graphs. Our approach formally bridges the gap between density-based clustering and graph connectivity, leveraging efficient propagation mechanisms from network science to mitigate the parameter sensitivity inherent in traditional density-based methods. Specifically, we introduce a deterministic density-based propagation strategy to ensure scalable neighborhood identification. The framework is agnostic to the choice of distance metric and exhibits superior performance on large-scale data, processing millions of points in minutes while consistently outperforming existing baselines in accuracy.
| Comments: | arXiv admin note: substantial text overlap with arXiv:2508.02989 |
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2605.00390 [cs.LG] |
| (or arXiv:2605.00390v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2605.00390 arXiv-issued DOI via DataCite (pending registration) |
From: Ninh Pham [view email]
[v1]
Fri, 1 May 2026 04:26:26 UTC (156 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。