Deep Synchronisation-based Clustering

Lena G. M. Bauer, Peter Salah, Pascal Weber, Anna Beer, Christian Böhm, Yllka Velaj, Claudia Plant

Keywords: clustering, deep clustering, synchronisation

TL;DR: This paper introduces DeepSynC, a deep clustering algorithm with a novel synchronisation-based loss function and a gradual cluster assignment strategy, allowing for automatic detection of ambiguous points as well as the number of training iterations.

Abstract: Identifying patterns in high-dimensional and complex data, such as images, requires techniques that extract meaningful features. Deep clustering combines the representation power of neural networks with classical clustering and has shown strong performance on such data. However, most approaches build on k-Means, inheriting its assumptions about cluster shapes, requiring the number of clusters in advance, and lacking an intuitive stopping criterion. We propose DeepSynC, the first synchronisation-based deep clustering algorithm that overcomes these limitations. It begins by identifying core points in the embedded space and assigning them to clusters. A novel cluster loss then synchronises similarly embedded objects, enabling the gradual assignment of further points. This combination of synchronisation-based loss and assignment strategy allows greater flexibility in cluster shape and introduces an automatic stopping condition for training.

Primary Area: unsupervised, self-supervised, semi-supervised, and supervised representation learning

Submission Number: 11308