Title :
Projection pursuit mixture density estimation
Author_Institution :
Dept. of Electr. & Comput. Eng., Ben-Gurion Univ. of the Negev, Beer-Sheva, Israel
Abstract :
In this paper we seek a Gaussian mixture model (GMM) of an n-variate probability density function. Usually the parameters of GMMs are determined in the original n-dimensional space by optimizing a maximum likelihood (ML) criterion. A practical deficiency of this method of fitting GMMs is its poor performance when dealing with high-dimensional data since a large sample size is needed to match the accuracy that is possible in low dimensions. We propose a method for fitting the GMM based on the projection pursuit strategy. This GMM is highly constrained and hence its ability to model structure in subspaces is enhanced, compared to a direct ML fitting of a GMM in high dimensions. Our method is closely related to recently developed independent factor analysis (IFA) mixture models. The comparisons with ML fitting of GMM in n-dimensions and IFA mixtures show that the proposed method is an attractive choice for fitting GMMs using small sizes of training sets.
Keywords :
Gaussian processes; blind source separation; probability; set theory; blind source separation; fitting Gaussian mixture model; independent factor analysis; n-variate probability density function; projection pursuit mixture density estimation; projection pursuit strategy; training sets; Computational complexity; Covariance matrix; Density functional theory; Independent component analysis; Maximum likelihood estimation; Principal component analysis; Probability density function; Robot kinematics; Source separation; Subspace constraints; Blind source separation; Gaussian mixture models; independent component analysis; independent factor analysis; latent variable models; multivariate density estimation; probabilistic principal component analysis; projection pursuit; radial basis functions; small sample size;
Journal_Title :
Signal Processing, IEEE Transactions on
DOI :
10.1109/TSP.2005.857007