Significance-Based Categorical Data Clustering
Not on the map. Why?
Abstract (arXiv)
Although numerous algorithms have been proposed to solve the categorical data clustering problem, how to access the statistical significance of a set of categorical clusters remains unaddressed. To fulfill this void, we employ the likelihood ratio test to derive a test statistic that can serve as a significance-based objective function in categorical data clustering. Consequently, a new clustering algorithm is proposed in which the significance-based objective function is optimized via a Monte Carlo search procedure. As a by-product, we can further calculate an empirical p-value to assess the statistical significance of a set of clusters and develop an improved gap statistic for estimating the cluster number. Extensive experimental studies suggest that our method is able to achieve comparable performance to state-of-the-art categorical data clustering algorithms. Moreover, the effectiveness of such a significance-based formulation on statistical cluster validation and cluster number estimation is demonstrated through comprehensive empirical results.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 7 of its 68 references that are in the map. First posted on arXiv 8 Nov 2022.
Builds on
7 of 68 references.
References · 7
- 2018To Cluster, or Not to Cluster: An Analysis of Clusterability Methodscited by 17
- 2020Unsupervised Heterogeneous Coupling Learning for Categorical Representationcited by 13
- 2014Statistical Significance for Hierarchical Clusteringcited by 9
- 2013Statistical Significance of Clustering using Soft Thresholdingcited by 5
- 2021Dimensionality Reduction for Categorical Datacited by 4
- 2021Statistically-Robust Clustering Techniques for Mapping Spatial Hotspots: A Surveycited by 3
- 2018U-statistical inference for hierarchical clusteringcited by 1
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 2.
3 papers.