Phase transitions for high dimensional clustering and related problems
From MaRDI portal
Publication:1687124
Abstract: Consider a two-class clustering problem where we observe , , . The feature vector is unknown but is presumably sparse. The class labels are also unknown and the main interest is to estimate them. We are interested in the statistical limits. In the two-dimensional phase space calibrating the rarity and strengths of useful features, we find the precise demarcation for the Region of Impossibility and Region of Possibility. In the former, useful features are too rare/weak for successful clustering. In the latter, useful features are strong enough to allow successful clustering. The results are extended to the case of colored noise using Le Cam's idea on comparison of experiments. We also extend the study on statistical limits for clustering to that for signal recovery and that for hypothesis testing. We compare the statistical limits for three problems and expose some interesting insight. We propose classical PCA and Important Features PCA (IF-PCA) for clustering. For a threshold , IF-PCA clusters by applying classical PCA to all columns of with an -norm larger than . We also propose two aggregation methods. For any parameter in the Region of Possibility, some of these methods yield successful clustering. We find an interesting phase transition for IF-PCA. Our results require delicate analysis, especially on post-selection Random Matrix Theory and on lower bound arguments.
Recommendations
- Influential features PCA for high dimensional clustering
- Classification of sparse high-dimensional vectors
- Clustering and feature selection using sparse principal component analysis
- Clustering High-Dimensional Data via Feature Selection
- Impossibility of successful classification when useful features are rare and weak
Cited in
(21)- Feature screening in large scale cluster analysis
- A simple approach to sparse clustering
- Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics
- Statistical limits of sparse mixture detection
- Testing equivalence of clustering
- High-dimensional incipient infinite clusters revisited
- scientific article; zbMATH DE number 7370563 (Why is no real title available?)
- Covariate regularized community detection in sparse graphs
- Influential features PCA for high dimensional clustering
- Computationally efficient sparse clustering
- Optimal Estimation of the Number of Network Communities
- Power enhancement and phase transitions for global testing of the mixed membership stochastic block model
- Estimation of the Number of Spiked Eigenvalues in a Covariance Matrix by Bulk Eigenvalue Matching Analysis
- Estimation of misclassification rate in the Asymptotic Rare and Weak model with sub-Gaussian noises
- Optimal clustering by Lloyd's algorithm for low-rank mixture model
- Spectral clustering on aggregated multilayer networks with covariates
- Uniform error bound for PCA matrix denoising
- Clustering a mixture of Gaussians with unknown covariance
- Optimal estimation of misclassification rate for two-class clustering with sub-Gaussian noises
- Network-adjusted covariates for community detection
- Mean field models for large data-clustering problems
This page was built for publication: Phase transitions for high dimensional clustering and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1687124)