2040 search results - page 183 / 408 » Approximate Expectation Maximization |
155
click to vote
NIPS
2007
15 years 7 months ago
2007
We propose an active learning algorithm that learns a continuous valuation model from discrete preferences. The algorithm automatically decides what items are best presented to an...
159
click to vote
EACL
2006
ACL Anthology
15 years 7 months ago
2006
ACL Anthology
Probabilistic Latent Semantic Analysis (PLSA) models have been shown to provide a better model for capturing polysemy and synonymy than Latent Semantic Analysis (LSA). However, th...
165
click to vote
IMAGING
2004
15 years 7 months ago
2004
A computer simulation was performed to investigate the optimum combinations of three- and four-chromatic inks in order to maximize the color gamut for halftone printing. A virtual...
135
click to vote
NIPS
1998
15 years 7 months ago
1998
The W-S (Wake-Sleep) algorithm is a simple learning rule for the models with hidden variables. It is shown that this algorithm can be applied to a factor analysis model which is a...
160
click to vote
NIPS
2000
15 years 7 months ago
2000
Non-negative matrix factorization (NMF) has previously been shown to be a useful decomposition for multivariate data. Two different multiplicative algorithms for NMF are analyzed....