Efficient Computation of Normalized Maximum Likelihood Codes for Gaussian Mixture Models With Its Applications to Clustering

DOI10.1109/TIT.2013.2276036MaRDI QIDQ5346277zbMATH OpenFDO

Authors So Hirai, Kenji Yamanishi

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2013.2276036

Mathematics Subject Classification ID

Point estimation (62F10) Estimation in multivariate analysis (62H12) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Other types of codes (94B60)

Cited in

(4)

• The decomposed normalized maximum likelihood code-length criterion for selecting hierarchical latent variable models
• Minimum description length revisited
• scientific article; zbMATH DE number 7307486 (Why is no real title available?)
• Online prediction for streaming observational data

This page was built for publication: Efficient Computation of Normalized Maximum Likelihood Codes for Gaussian Mixture Models With Its Applications to Clustering

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