Computationally efficient sparse clustering
From MaRDI portal
Recommendations
- Statistical and computational trade-offs in estimation of sparse principal components
- Phase transitions for high dimensional clustering and related problems
- Sparse CCA: adaptive estimation and computational barriers
- Statistical-computational tradeoffs in planted problems and submatrix localization with a growing number of clusters and submatrices
- Optimal detection of sparse principal components in high dimension
Cited in
(14)- A simple approach to sparse clustering
- Sparse probabilistic K-means
- Efficient Computation of the Weighted Clustering Coefficient
- Application of sparse spectral clustering algorithm in high-dimensional data
- Efficient computation of the Weighted Clustering Coefficient
- Optimal estimation and computational limit of low-rank Gaussian mixtures
- Estimation of misclassification rate in the Asymptotic Rare and Weak model with sub-Gaussian noises
- Computational lower bounds for graphon estimation via low-degree polynomials
- Computational and statistical thresholds in multi-layer stochastic block models
- Optimal clustering by Lloyd's algorithm for low-rank mixture model
- Sparse linear regression when noises and covariates are heavy-tailed and contaminated by outliers
- Precise error rates for computationally efficient testing
- Sharp-SSL: Selective High-Dimensional Axis-Aligned Random Projections for Semi-Supervised Learning
- Tensor-on-tensor regression: Riemannian optimization, over-parameterization, statistical-computational gap and their interplay
This page was built for publication: Computationally efficient sparse clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5878241)
