Correction to Efficient Computation of Normalized Maximum Likelihood Codes for Gaussian Mixture Models With Its Applications to Clustering
Lists
Only you see this
Abstract
This paper corrects errors in the calculation of the normalized maximum likelihood (NML) code length for a Gaussian mixture model (GMM). It shows that the NML code length calculated in “efficient computation of the NML codes for the GMMs with its applications to clustering” is an upper bound on the NML code length strictly calculated for the GMM. In addition, we correct the NML code length for generalized logistic distribution.
BibTeX
@article{hirai2019correction,
author = {So Hirai and Kenji Yamanishi},
title = {{Correction to Efficient Computation of Normalized Maximum Likelihood Codes for Gaussian Mixture Models With Its Applications to Clustering}},
journal = {IEEE Trans. Information Theory},
year = {2019},
doi = {10.1109/tit.2019.2915237},
}Loading related content...