Spectral clustering algorithm for the allometric extension model
From MaRDI portal
Cites work
- A central limit theorem for k-means clustering
- Allometric Extension
- Allometric extension model for conditional distributions
- An \({\ell_p}\) theory of PCA and spectral clustering
- Asymptotics of hierarchical clustering for growing dimension
- Encyclopedia of statistical sciences. 16 Vols.
- High-dimensional hypothesis testing for allometric extension model
- High-dimensional probability. An introduction with applications in data science
- scientific article; zbMATH DE number 1070609 (Why is no real title available?)
- Learning mixtures of spherical Gaussians: moment methods and spectral decompositions (extended abstract)
- Model-Based Clustering, Classification, and Density Estimation Using mclust in R
- Normal Discrimination with Unclassified Observations
- Optimality of spectral clustering in the Gaussian mixture model
- Principal points for an allometric extension model
- Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics
- Sharp optimal recovery in the two component Gaussian mixture model
- Statistical Analysis of Financial Data in S-Plus
- Strong consistency of k-means clustering
Cited in
(2)
This page was built for publication: Spectral clustering algorithm for the allometric extension model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7005817)
