Training Gaussian mixture models at scale via coresets
zbMATH Open1464.68316arXiv1703.08110MaRDI QIDQ4558482FDOQ4558482
Authors: Mario Lucic, Matthew Faulkner, Andreas Krause, Dan Feldman
Publication date: 22 November 2018
Full work available at URL: https://arxiv.org/abs/1703.08110
Recommendations
- On coresets for support vector machines
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
- Turning big data into tiny data: constant-size coresets for \(k\)-means, PCA and projective clustering
- Sketching for large-scale learning of mixture models
- Compressive Gaussian mixture estimation
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Computational aspects of data analysis and big data (68T09) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pattern recognition and machine learning.
- Machine learning. A probabilistic perspective
- CUR matrix decompositions for improved data analysis
- Turning Big data into tiny data: Constant-size coresets for k-means, PCA and projective clustering
- Title not available (Why is that?)
- Tensor decompositions for learning latent variable models
- Neural Network Learning
- Learning mixtures of separated nonspherical Gaussians
- Efficiently learning mixtures of two Gaussians
- Decomposable searching problems I. Static-to-dynamic transformation
- On coresets for k-means and k-median clustering
- A PTAS for k-means clustering based on weak coresets
- Title not available (Why is that?)
- A spectral algorithm for learning mixture models
- Coresets in dynamic geometric data streams
- A unified framework for approximating and clustering data
- VC dimensions of principal component analysis
- High-dimensional shape fitting in linear time
- Sublinear‐time approximation algorithms for clustering via random sampling
- PAC Learning Axis-Aligned Mixtures of Gaussians with No Separation Assumption
- Polynomial Learning of Distribution Families
- A Bi-Criteria Approximation Algorithm for k-Means
- Title not available (Why is that?)
- Learning big (image) data via coresets for dictionaries
Cited In (5)
Uses Software
This page was built for publication: Training Gaussian mixture models at scale via coresets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4558482)