Resolution-Based Complexity Control for Gaussian Mixture Models

DOI10.1162/089976601300014600zbMath0973.68076OpenAlexW2137735763WikidataQ128253402 ScholiaQ128253402MaRDI QIDQ2708448

Helge J. Ritter, Peter Meinicke

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

unsupervised learningstatistical modeling

Mathematics Subject Classification ID

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

Related Items (1)

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

Uses Software

• MNIST

Cites Work

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

This page was built for publication: Resolution-Based Complexity Control for Gaussian Mixture Models