Training Gaussian mixture models at scale via coresets
From MaRDI portal
(Redirected from Publication:4558482)
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)
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
Cites work
- scientific article; zbMATH DE number 6381735 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 5019895 (Why is no real title available?)
- A PTAS for k-means clustering based on weak coresets
- A bi-criteria approximation algorithm for \(k\)-means
- A spectral algorithm for learning mixture models
- A tensor approach to learning mixed membership community models
- A unified framework for approximating and clustering data
- CUR matrix decompositions for improved data analysis
- Coresets in dynamic geometric data streams
- Decomposable searching problems I. Static-to-dynamic transformation
- Efficiently learning mixtures of two Gaussians
- High-dimensional shape fitting in linear time
- Learning big (image) data via coresets for dictionaries
- Learning mixtures of separated nonspherical Gaussians
- Machine learning. A probabilistic perspective
- Neural Network Learning
- On coresets for k-means and k-median clustering
- PAC Learning Axis-Aligned Mixtures of Gaussians with No Separation Assumption
- Pattern recognition and machine learning.
- Polynomial Learning of Distribution Families
- Sublinear‐time approximation algorithms for clustering via random sampling
- Tensor decompositions for learning latent variable models
- Turning big data into tiny data: constant-size coresets for k-means, PCA and projective clustering
- Universal \({\epsilon}\)-approximators for integrals
- VC dimensions of principal component analysis
Cited in
(9)- scientific article; zbMATH DE number 2089922 (Why is no real title available?)
- Compressive statistical learning with random feature moments
- On sampling based algorithms for k-means
- Parsimonious reduction of Gaussian mixture models with a variational-Bayes approach
- Making sense of economics datasets with evolutionary coresets
- Optimal sample selection through uncertainty estimation and its application in deep learning
- On coresets for support vector machines
- The coreset variational Bayes (CVB) algorithm for mixture analysis
- Core-sets: updated survey
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)
