A spectral algorithm for learning mixture models

DOI10.1016/j.jcss.2003.11.008zbMath1074.68028OpenAlexW1980018091MaRDI QIDQ598259

Grant Wang, Santosh Vempala

Publication date: 6 August 2004

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2003.11.008

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items (28)

IAN: Iterated Adaptive Neighborhoods for Manifold Learning and Dimensionality Estimation ⋮ Learning diagonal Gaussian mixture models and incomplete tensor decompositions ⋮ Statistical learning guarantees for compressive clustering and compressive mixture modeling ⋮ Optimal estimation of high-dimensional Gaussian location mixtures ⋮ Recovery guarantees for exemplar-based clustering ⋮ Clustering subgaussian mixtures by semidefinite programming ⋮ Mixed membership Gaussians ⋮ Multiple Pass Streaming Algorithms for Learning Mixtures of Distributions in ${\mathbb R}^d$ ⋮ A spectral algorithm for learning hidden Markov models ⋮ Recovering Structured Probability Matrices ⋮ Improved convergence guarantees for learning Gaussian mixture models by EM and gradient EM ⋮ Graph characteristics from the heat kernel trace ⋮ Unnamed Item ⋮ Good (K-means) clusterings are unique (up to small perturbations) ⋮ When do birds of a feather flock together? \(k\)-means, proximity, and conic programming ⋮ Cluster forests ⋮ Statistical convergence of the EM algorithm on Gaussian mixture models ⋮ Multiple pass streaming algorithms for learning mixtures of distributions in \(\mathbb R^d\) ⋮ Optimality of spectral clustering in the Gaussian mixture model ⋮ The random projection method in goodness of fit for functional data ⋮ Partial recovery bounds for clustering with the relaxed \(K\)-means ⋮ Statistical and Computational Guarantees for the Baum-Welch Algorithm ⋮ Structured matrix estimation and completion ⋮ Covariate Regularized Community Detection in Sparse Graphs ⋮ Sharp optimal recovery in the two component Gaussian mixture model ⋮ An \({\ell_p}\) theory of PCA and spectral clustering ⋮ A spectral algorithm for latent Dirichlet allocation ⋮ Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Latent semantic indexing: A probabilistic analysis
• Isoperimetric problems for convex bodies and a localization lemma
• Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
• Learning mixtures of arbitrary gaussians
• Spectral analysis of data
• Fast monte-carlo algorithms for finding low-rank approximations

This page was built for publication: A spectral algorithm for learning mixture models