SPORE: Skeleton Propagation Over Recalibrating Expansions
Not on the map. Why?
Abstract (arXiv)
Many real-world datasets are not linearly separable, limiting the effectiveness of centroid-based clustering methods such as K-means. Density-based clustering methods address this limitation by identifying clusters with arbitrary geometric structure; however, existing approaches exhibit two persistent shortcomings. First, they often underperform in the presence of heterogeneous local densities, where a single density threshold cannot adequately capture clusters across multiple density scales. Second, they generally lack the clear boundary delineation naturally induced by the linear partitioning mechanism of centroid-based methods. This paper introduces SPORE (Skeleton Propagation Over Recalibrating Expansions), a clustering algorithm designed to address both challenges while preserving the geometric flexibility of density-based approaches. SPORE operates in two stages: an adaptive cluster expansion phase followed by a proximity-driven boundary propagation phase that maintains discriminative capability even under weak density contrast. The proposed method is evaluated on 28 benchmark datasets against established density-based baselines, with K-means included as a reference centroid-based method. Experimental results demonstrate that SPORE achieves significantly improved cluster recovery relative to all evaluated baselines (p < 0.01), while strong-performing configurations can be identified within five random-search evaluations.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 5 of its 72 references that are in the map. First posted on arXiv 29 Oct 2025.
Builds on
5 of 72 references.
References · 5
- 2018Deep Clustering for Unsupervised Learning of Visual Featurescited by 1,028
- 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 861
- 2015Unsupervised Deep Embedding for Clustering Analysiscited by 767
- 2018From Louvain to Leiden: guaranteeing well-connected communitiescited by 385
- 2017Learning Discrete Representations via Information Maximizing Self-Augmented Trainingcited by 149
Built on by
Not cited yet.