288 pp. per issue
6 x 9, illustrated
2014 Impact factor:

Neural Computation

February 2001, Vol. 13, No. 2, Pages 453-475
(doi: 10.1162/089976601300014600)
© 2001 Massachusetts Institute of Technology
Resolution-Based Complexity Control for Gaussian Mixture Models
Article PDF (194.35 KB)

In the domain of unsupervised learning, mixtures of gaussians have become a popular tool for statistical modeling. For this class of generative models, we present a complexity control scheme, which provides an effective means for avoiding the problem of overfitting usually encountered with unconstrained (mixtures of) gaussians in high dimensions. According to some prespecified level of resolution as implied by a fixed variance noise model, the scheme provides an automatic selection of the dimensionalities of some local signal subspaces by maximum likelihood estimation. Together with a resolution-based control scheme for adjusting the number of mixture components, we arrive at an incremental model refinement procedure within a common deterministic annealing framework, which enables an efficient exploration of the model space. The advantages of the resolution-based framework are illustrated by experimental results on synthetic and high-dimensional real-world data.