LGAIOct 12, 2024

Dying Clusters Is All You Need -- Deep Clustering With an Unknown Number of Clusters

arXiv:2410.09491v13 citationsh-index: 4Has Code2024 IEEE International Conference on Data Mining Workshops (ICDMW)
Originality Incremental advance
AI Analysis

This addresses a major limitation in unsupervised learning for data mining, where the number of clusters is often unknown, making it broadly applicable but incremental in combining existing methods.

The paper tackles the problem of deep clustering without requiring a predefined number of clusters, proposing UNSEEN, a framework that estimates the number of clusters starting from an upper bound and integrates with various deep clustering algorithms, achieving competitive results on image and tabular datasets.

Finding meaningful groups, i.e., clusters, in high-dimensional data such as images or texts without labeled data at hand is an important challenge in data mining. In recent years, deep clustering methods have achieved remarkable results in these tasks. However, most of these methods require the user to specify the number of clusters in advance. This is a major limitation since the number of clusters is typically unknown if labeled data is unavailable. Thus, an area of research has emerged that addresses this problem. Most of these approaches estimate the number of clusters separated from the clustering process. This results in a strong dependency of the clustering result on the quality of the initial embedding. Other approaches are tailored to specific clustering processes, making them hard to adapt to other scenarios. In this paper, we propose UNSEEN, a general framework that, starting from a given upper bound, is able to estimate the number of clusters. To the best of our knowledge, it is the first method that can be easily combined with various deep clustering algorithms. We demonstrate the applicability of our approach by combining UNSEEN with the popular deep clustering algorithms DCN, DEC, and DKM and verify its effectiveness through an extensive experimental evaluation on several image and tabular datasets. Moreover, we perform numerous ablations to analyze our approach and show the importance of its components. The code is available at: https://github.com/collinleiber/UNSEEN

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes