# A Fast Synchronization Clustering Algorithm

arXiv: https://arxiv.org/abs/1407.7449 · HTML: https://mlsanity.com/paper/1407.7449/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 23 Jul 2014.

## Built on by (most cited first, 1 of 1)

- [Synchronization-based clustering on the unit hypersphere](https://mlsanity.com/paper/2603.05067/) (2026)

## Abstract (arXiv)

This paper presents a Fast Synchronization Clustering algorithm (FSynC), which is an improved version of SynC algorithm. In order to decrease the time complexity of the original SynC algorithm, we combine grid cell partitioning method and Red-Black tree to construct the near neighbor point set of every point. By simulated experiments of some artificial data sets and several real data sets, we observe that FSynC algorithm can often get less time than SynC algorithm for many kinds of data sets. At last, it gives some research expectations to popularize this algorithm.