Gaussian mixture model clustering with a completed likelihood minimum message length criterion

DOI10.3969/J.ISSN.1003-7985.2013.01.009MaRDI QIDQ5398814zbMATH OpenFDO

Authors Hong Zeng, Wei Lü, Aiguo Song

Publication date 28 February 2014

Full work available at URL https://doi.org/10.3969/J.ISSN.1003-7985.2013.01.009

zbMATH Keywords

completed likelihood minimum message length criterionexpectation-maximization algorithmGaussian mixture modelmodel selectionnon-Gaussian distribution

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Recommendations

• A robust EM clustering algorithm for Gaussian mixture models
• scientific article; zbMATH DE number 2231117
• scientific article; zbMATH DE number 1954136
• Identifying connected components in Gaussian finite mixture models for clustering
• Unsupervised classification based on penalized maximum likelihood of Gaussian mixture models

Cited in

(4)

• scientific article; zbMATH DE number 1954136 (Why is no real title available?)
• Multivariate bounded asymmetric Gaussian mixture model
• Identifying the number of components in Gaussian mixture models using numerical algebraic geometry
• A parameter optimization method for Gaussian mixture model with data evolution

This page was built for publication: Gaussian mixture model clustering with a completed likelihood minimum message length criterion

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