Learning Theory
From MaRDI portal
Publication:5473630
DOI10.1007/b137542zbMath1137.68512OpenAlexW4246660828MaRDI QIDQ5473630
Frank McSherry, Demetrios Achlioptas
Publication date: 22 June 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b137542
singular value decompositionspectral methodsgaussians mixtureslearning mixtures of distributionslog-concave and concentrated distributions
Related Items
Learning diagonal Gaussian mixture models and incomplete tensor decompositions ⋮ Clusterability assessment for Gaussian mixture models ⋮ Statistical learning guarantees for compressive clustering and compressive mixture modeling ⋮ Optimal estimation of high-dimensional Gaussian location mixtures ⋮ Recovery guarantees for exemplar-based clustering ⋮ Separating populations with wide data: a spectral analysis ⋮ Identifiability of nonparametric mixture models and Bayes optimal clustering ⋮ Separating Populations with Wide Data: A Spectral Analysis ⋮ Improved convergence guarantees for learning Gaussian mixture models by EM and gradient EM ⋮ Dimensionality reduction for data of unknown cluster structure ⋮ 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 ⋮ A Model-Based Embedding Technique for Segmenting Customers ⋮ Partial recovery bounds for clustering with the relaxed \(K\)-means ⋮ Polynomial Learning of Distribution Families ⋮ Log-concavity of a mixture of beta distributions ⋮ A spectral algorithm for latent Dirichlet allocation ⋮ Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model
