mlsanityData to 7 Oct 2026

Synchronization-based clustering on the unit hypersphere

arXiv 2603.05067 ↗First posted 5 Mar 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Clustering on the unit hypersphere is a fundamental problem in various fields, with applications ranging from gene expression analysis to text and image classification. Traditional clustering methods are not always suitable for unit sphere data, as they do not account for the geometric structure of the sphere. We introduce a novel algorithm for clustering data represented as points on the unit sphere Sd-1. Our method is based on the d-dimensional generalized Kuramoto model. The effectiveness of the introduced method is demonstrated on synthetic and real-world datasets. Results are compared with some of the traditional clustering methods, showing that our method achieves similar or better results in terms of clustering accuracy.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 3 of its 32 references that are in the map. First posted on arXiv 5 Mar 2026.

Builds on

3 of 32 references.

References · 3

  1. 2020Recent advances in directional statisticscited by 14
  2. 2014A Fast Synchronization Clustering Algorithmcited by 1
  3. 2021A new dynamical model for solving rotation averaging problemcited by 1

Built on by

Not cited yet.