How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models

DOI10.1007/s11634-019-00366-7zbMath1474.62457OpenAlexW2957767484WikidataQ127588382 ScholiaQ127588382MaRDI QIDQ2183660

Kathrin Bujna, Johannes Blömer, Daniel Kuntze, Sascha Brauer

Publication date: 27 May 2020

Published in: Advances in Data Analysis and Classification. ADAC (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11634-019-00366-7

zbMATH Keywords

EM algorithmmixture modelsSEM algorithmnon-asymptotic analysis

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms (68W40) Point estimation (62F10) Monte Carlo methods (65C05) Randomized algorithms (68W20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Statistical aspects of big data and data science (62R07)

Uses Software

• UCI-ml
• PRMLT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mixtures of multivariate power exponential distributions
• The stochastic EM algorithm: Estimation and asymptotic results
• On simulated EM algorithms
• A classification EM algorithm for clustering and two stochastic versions
• Robust Clustering Using Exponential Power Mixtures
• Stochastic versions of the em algorithm: an experimental study in the mixture case
• A multivariate generalization of the power exponential family of distributions

This page was built for publication: How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models