arxiv
PublishedJuly 13, 2026 at 4:00 AM
—neutral
Scalable Varied-Density Clustering via Graph Propagation
Publisher summary· verbatim
arXiv:2508.02989v2 Announce Type: replace Abstract: We propose a novel perspective on varied-density clustering for high-dimensional data by framing it as a label propagation process in neighborhood graphs that adapt to local density variations. Our method formally connects density-based clustering
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivBeyond a Single Direction: Chain-of-Thought Disrupts Simple Steering of Refusal3harxivRobustSpeechFlow: Learning Robust Text-to-Speech Trajectories via Augmentation-based Contrastive Flow Matching3harxivVarRate: Training-Free Variable-Rate KV Cache Compression for Long-Context LLMs3harxivAdaptive Multi-Step Lookahead Decoding for Diffusion Language Models3hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗