Clustering Plotted Data by Image Segmentation
Tarek Naous, Srinjay Sarkar, Abubakar Abid, James Zou
Abstract
Clustering is a popular approach to detecting patterns in unlabeled data. Existing clustering methods typically treat samples in a dataset as points in a metric space and compute distances to group together similar points. In this paper, we present a different way of clustering points in 2-dimensional space, inspired by how humans cluster data: by training neural networks to perform instance segmentation on plotted data. Our approach, Visual Clustering, has several advantages over traditional clustering algorithms: it is much faster than most existing clustering algorithms (making it suitable for very large datasets), it agrees strongly with human intuition for clusters, and it is by default hyperparameter free (although additional steps with hyperparameters can be introduced for more control of the algorithm). We describe the method and compare it to ten other clustering methods on synthetic data to illustrate its advantages and disadvantages. We then demonstrate how our approach can be extended to higher-dimensional data and illustrate its performance on real-world data. Our implementation of Visual Clustering is publicly available as a python package that can be installed and used on any dataset in a few lines of code <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sup> <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sup> https://hithub.com/tareknaous/visual-clustering. A demo on synthetic datasets is provided <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> https://huggingface.co/spaces/CVPR/visual-clustering.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 9b6002cb-8d01-494b-90aa-15d9e5694154Builds on1
Related papers
- Efficient Clustering Based On A Unified View Of -means And Ratio-cutShenfei Pei, Feiping Nie, Rong Wang, Xuelong LiNeurIPS 2020 · 30 citations
- Image Clustering via the Principle of Rate Reduction in the Age of Pretrained ModelsTianzhe Chu, Shengbang Tong, Tianjiao Ding, Xili Dai et al.ICLR 2024 · 22 citations
- Neural Clustering Based Visual Representation LearningGuikun Chen, Xia Li, Yi Yang, Wenguan WangCVPR 2024
- Fast and Simple Spectral Clustering in Theory and PracticePeter MacgregorNeurIPS 2023 · 12 citations
- Local Aggregation for Unsupervised Learning of Visual EmbeddingsChengxu Zhuang, Alex Lin Zhai, Daniel YaminsICCV 2019 · 462 citations
