Scalable Clustering: Large Scale Unsupervised Learning of Gaussian Mixture Models with Outliers

DOI10.1080/10618600.2024.2414889MaRDI QIDQ6892373zbMATH OpenFDO

Authors Yijia Zhou, K. A. Gallivan, Adrian Barbu

Publication date 1 December 2025

Published in Journal of Computational and Graphical Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10618600.2024.2414889

Mathematics Subject Classification ID

Statistics (62-XX)

Cites work

• scientific article; zbMATH DE number 3793441 (Why is no real title available?)
• scientific article; zbMATH DE number 3567782 (Why is no real title available?)
• scientific article; zbMATH DE number 3436645 (Why is no real title available?)
• scientific article; zbMATH DE number 2205355 (Why is no real title available?)
• A probabilistic analysis of EM for mixtures of separated, spherical Gaussians
• A spectral algorithm for learning mixture models
• Clustering to minimize the maximum intercluster distance
• Contributions to the mathematical theory of evolution.
• Hierarchical clustering schemes
• High-dimensional statistics. A non-asymptotic viewpoint
• Improved convergence guarantees for learning Gaussian mixture models by EM and gradient EM
• Learning mixtures of spherical Gaussians: moment methods and spectral decompositions (extended abstract)
• Least squares quantization in PCM
• Local minima structures in Gaussian mixture models
• Lower Bounds for the Partitioning of Graphs
• Optimality of spectral clustering in the Gaussian mixture model
• Robustly learning mixtures of k arbitrary Gaussians
• Singularity, misspecification and the convergence rate of EM
• Visualizing data using t-SNE

This page was built for publication: Scalable Clustering: Large Scale Unsupervised Learning of Gaussian Mixture Models with Outliers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6892373)