Mini-batch learning of exponential family finite mixture models
From MaRDI portal
Publication:2195820
DOI10.1007/s11222-019-09919-4zbMath1447.62073arXiv1902.03335OpenAlexW2999410093WikidataQ115602839 ScholiaQ115602839MaRDI QIDQ2195820
Geoffrey J. McLachlan, Hien Duy Nguyen, Florence Forbes
Publication date: 27 August 2020
Published in: Statistics and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.03335
online algorithmexpectation-maximization algorithmfinite mixture modelsexponential family of distributionsnormal mixture modelsmini-batch algorithm
Multivariate distribution of statistics (62H10) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Statistical aspects of big data and data science (62R07)
Related Items
Sufficient dimension reduction for clustered data via finite mixture modelling, Global implicit function theorems and the online expectation–maximisation algorithm, Frugal Gaussian clustering of huge imbalanced datasets through a bin-marginal approach, Properties of the stochastic approximation EM algorithm with mini-batch sampling, Fast incremental expectation maximization for finite-sum optimization: nonasymptotic convergence, Summary statistics and discrepancy measures for approximate Bayesian computation via surrogate posteriors
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithm AS 136: A K-Means Clustering Algorithm
- Information geometry and its applications
- High-dimensional data clustering
- On the convergence properties of the EM algorithm
- New method of stochastic approximation type
- Handbook of big data analytics
- Speeding up the EM algorithm for mixture model-based segmentation of magnetic resonance images
- Convergence of a stochastic approximation version of the EM algorithm
- Principal component analysis.
- A greedy EM algorithm for Gaussian mixture learning
- Maximum likelihood estimation of Gaussian mixture models without matrix operations
- On-Line Expectation–Maximization Algorithm for latent Data Models
- Signal Processing and Networking for Big Data Applications
- Statistical Distributions
- Advanced Mathematics for Applications
- Probability for Statistics and Machine Learning
- Estimating the false discovery rate using the stochastic approximation algorithm
- The EM Algorithm and Extensions, 2E
- Convergence of stochastic approximation algorithms under irregular conditions
- Acceleration of Stochastic Approximation by Averaging
- Handbook of Big Data
- Seamless R and C++ Integration with Rcpp
- On Information and Sufficiency
- Stochastic Estimation of the Maximum of a Regression Function
- A Stochastic Approximation Method
- Maximum Likelihood Estimation of Misspecified Models
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization