CoreSPECT: Enhancing Clustering Algorithms via an Interplay of Density and Geometry
Chandra Sekhar Mukherjee, Joonyoung Bae, and Jiapeng Zhang

TL;DR
CoreSPECT introduces a novel framework that enhances clustering algorithms by exploiting the density-geometry correlation in data, leading to significant improvements in clustering performance and efficiency across diverse datasets.
Contribution
The paper presents CoreSPECT, a new framework that improves clustering algorithms by leveraging density-geometry correlations and multi-layer propagation, with theoretical support and extensive experiments.
Findings
Improves K-Means NMI by 20% on average.
Boosts HDBSCAN NMI by over 100% on average.
Achieves competitive or superior results to state-of-the-art methods.
Abstract
In this paper, we provide a novel perspective on the underlying structure of real-world data with ground-truth clusters via characterization of an abundantly observed yet often overlooked density-geometry correlation, that manifests itself as a multi-layered manifold structure. We leverage this correlation to design CoreSPECT (Core Space Projection based Enhancement of Clustering Techniques), a general framework that improves the performance of generic clustering algorithms. Our framework boosts the performance of clustering algorithms by applying them to strategically selected regions, then extending the partial partition to a complete partition for the dataset using a novel neighborhood graph based multi-layer propagation procedure. We provide initial theoretical support of the functionality of our framework under the assumption of our model, and then provide large-scale…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
