Sciweavers

251 search results - page 12 / 51
» A Greedy EM Algorithm for Gaussian Mixture Learning
Sort
View
COLT
1995
Springer
15 years 1 months ago
A Comparison of New and Old Algorithms for a Mixture Estimation Problem
We investigate the problem of estimating the proportion vector which maximizes the likelihood of a given sample for a mixture of given densities. We adapt a framework developed for...
David P. Helmbold, Yoram Singer, Robert E. Schapir...
65
Voted
ICPR
2008
IEEE
15 years 11 months ago
Component-wise parameter smoothing for learning mixture models
In this paper, we propose a novel component-wise smoothing algorithm that constructs a hierarchy (or family) of smoothened log-likelihood surfaces. Our approach first smoothens th...
Bala Rajaratnam, Chandan K. Reddy
PAMI
2008
140views more  PAMI 2008»
14 years 9 months ago
Simplifying Mixture Models Using the Unscented Transform
Mixture of Gaussians (MoG) model is a useful tool in statistical learning. In many learning processes that are based on mixture models, computational requirements are very demandin...
Jacob Goldberger, Hayit Greenspan, Jeremie Dreyfus...
PKDD
2010
Springer
158views Data Mining» more  PKDD 2010»
14 years 8 months ago
Learning Sparse Gaussian Markov Networks Using a Greedy Coordinate Ascent Approach
In this paper, we introduce a simple but efficient greedy algorithm, called SINCO, for the Sparse INverse COvariance selection problem, which is equivalent to learning a sparse Ga...
Katya Scheinberg, Irina Rish
ICMCS
2009
IEEE
189views Multimedia» more  ICMCS 2009»
14 years 7 months ago
Emotion recognition from speech VIA boosted Gaussian mixture models
Gaussian mixture models (GMMs) and the minimum error rate classifier (i.e. Bayesian optimal classifier) are popular and effective tools for speech emotion recognition. Typically, ...
Hao Tang, Stephen M. Chu, Mark Hasegawa-Johnson, T...