Clustering with Geometric Modularity

22 Sept 2023 (modified: 11 Feb 2024)Submitted to ICLR 2024EveryoneRevisionsBibTeX
Primary Area: unsupervised, self-supervised, semi-supervised, and supervised representation learning
Code Of Ethics: I acknowledge that I and all co-authors of this work have read and commit to adhering to the ICLR Code of Ethics.
Keywords: clustering, modularity
Submission Guidelines: I certify that this submission complies with the submission instructions as described on https://iclr.cc/Conferences/2024/AuthorGuide.
TL;DR: We give a way to automatically tune the radius in DB-scan; this creates a fully hyper-parameter-free high-quality clustering algorithm.
Abstract: Clustering data is a fundamental problem in unsupervised learning with a range of applications in the natural and social sciences. This wide applicability has led to the development of dozens of clustering algorithms. Broadly, these algorithms can be divided as being (i) parametric, e.g. $k$-means, where the centers are parameters and $k$ a hyperparameter, and (ii) non-parametric, e.g. DB-Scan (Ester et al. 1996), which has hyperparameters, but otherwise only uses a density to find clustering. An attractive feature of DB-Scan is not needing to know the number of clusters (usually unknown in practice) in advance. In this work, we propose a new measure of cluster quality, called \emph{geometric modularity} and show how it can be used to obtain an improved algorithm based on DB-Scan. Through experiments on a wide-range of datasets we show that using geometric modularity yields a superior method. Interestingly, our experiments also show that this quantity tracks a \emph{supervised} measure called \emph{normalized mutual information} well, despite using no label information. Finally, we also provide a theoretical justification of the use of this measure by considering a model for well-clusterable data.
Anonymous Url: I certify that there is no URL (e.g., github page) that could be used to find authors' identity.
No Acknowledgement Section: I certify that there is no acknowledgement section in this submission for double blind review.
Submission Number: 5676
Loading