Resolution-based complexity control for Gaussian mixture models

DOI10.1162/089976601300014600MaRDI QIDQ2708448zbMATH OpenOpenAlexWikidataFDO

Authors Peter Meinicke, H. Ritter

Publication date 17 April 2001

Published in Neural Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1162/089976601300014600

zbMATH Keywords

statistical modelingunsupervised learning

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Unsupervised classification based on penalized maximum likelihood of Gaussian mixture models
• Efficient Greedy Learning of Gaussian Mixture Models
• Learning mixtures of arbitrary Gaussians
• scientific article; zbMATH DE number 2016130
• A greedy EM algorithm for Gaussian mixture learning

Cites work

• Algorithms for Model-Based Gaussian Hierarchical Clustering
• Asymptotic Theory for Principal Component Analysis
• Nonparametric maximum likelihood estimation by the method of sieves
• Vector quantization by deterministic annealing

Cited in

(1)

• Robust extraction of local structures by the minimum \(\beta\)-divergence method

Describes a project that uses

Uses Software

• MNIST

This page was built for publication: Resolution-based complexity control for Gaussian mixture models

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