GCAO: Group-driven Clustering via Gravitational Attraction and Optimization
Qi Li, Jun Wang

TL;DR
GCAO introduces a group-driven clustering method that leverages gravitational attraction and optimization to improve clustering stability and boundary clarity in high-dimensional, complex datasets.
Contribution
The paper proposes a novel group-level optimization approach that replaces point-based contraction with group-based gravitational interactions, enhancing clustering robustness.
Findings
GCAO outperforms 11 existing methods in multiple metrics.
Achieves average improvements of over 37% in NMI and ARI.
Maintains efficiency and scalability on high-dimensional data.
Abstract
Traditional clustering algorithms often struggle with high-dimensional and non-uniformly distributed data, where low-density boundary samples are easily disturbed by neighboring clusters, leading to unstable and distorted clustering results. To address this issue, we propose a Group-driven Clustering via Gravitational Attraction and Optimization (GCAO) algorithm. GCAO introduces a group-level optimization mechanism that aggregates low-density boundary points into collaboratively moving groups, replacing the traditional point-based contraction process. By combining local density estimation with neighborhood topology, GCAO constructs effective gravitational interactions between groups and their surroundings, enhancing boundary clarity and structural consistency. Using groups as basic motion units, a gravitational contraction strategy ensures globally stable and directionally consistent…
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.
