UniForCE: The Unimodality Forest Method for Clustering and Estimation of the Number of Clusters
Not on the map. Why?
Abstract (arXiv)
Estimating the number of clusters k while clustering the data is a challenging task. An incorrect cluster assumption indicates that the number of clusters k gets wrongly estimated. Consequently, the model fitting becomes less important. In this work, we focus on the concept of unimodality and propose a flexible cluster definition called locally unimodal cluster. A locally unimodal cluster extends for as long as unimodality is locally preserved across pairs of subclusters of the data. Then, we propose the UniForCE method for locally unimodal clustering. The method starts with an initial overclustering of the data and relies on the unimodality graph that connects subclusters forming unimodal pairs. Such pairs are identified using an appropriate statistical test. UniForCE identifies maximal locally unimodal clusters by computing a spanning forest in the unimodality graph. Experimental results on both real and synthetic datasets illustrate that the proposed methodology is particularly flexible and robust in discovering regular and highly complex cluster shapes. Most importantly, it automatically provides an adequate estimation of the number of clusters.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 17 of its 77 references that are in the map. First posted on arXiv 18 Dec 2023.
Builds on
17 of 77 references.
References · 17
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2015Unsupervised Deep Embedding for Clustering Analysiscited by 763
- 2018SpectralNet: Spectral Clustering using Deep Neural Networkscited by 94
- 2020Fast and Eager k-Medoids Clustering: O(k) Runtime Improvement of the PAM, CLARA, and CLARANS Algorithmscited by 35
- 2018Deep Density-based Image Clusteringcited by 28
- 2018DBSCAN++: Towards fast and scalable density clusteringcited by 19
- 2015A review of mean-shift algorithms for clusteringcited by 18
- 2017Path-Based Spectral Clustering: Guarantees, Robustness to Outliers, and Fast Algorithmscited by 17
- 2018To Cluster, or Not to Cluster: An Analysis of Clusterability Methodscited by 17
- 2021Deep Embedded K-Means Clusteringcited by 12
- 2017Merging K-means with hierarchical clustering for identifying general-shaped groupscited by 7
- 2022Global k-means++: an effective relaxation of the global k-means clustering algorithmcited by 4
5 more
- 2023Multi-Prototypes Convex Merging Based K-Means Clustering Algorithmcited by 4
- 2020The UU-test for Statistical Modeling of Unimodal Datacited by 3
- 2021Git: Clustering Based on Graph of Intensity Topologycited by 3
- 2016Mode testing, critical bandwidth and excess masscited by 2
- 2023A Multivariate Unimodality Test Harnessing the Dip Statistic of Mahalanobis Distances Over Random Projectionscited by 2
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.