129 search results - page 2 / 26 » Self-Paced Learning for Matrix Factorization |
124
click to vote
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
In this paper, we describe a novel speaker adaptation algorithm based on Gaussian mixture weight adaptation. A small number of latent speaker vectors are estimated with non-negati...
129
click to vote
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
In this paper, we present a model for unsupervised pattern discovery using non-negative matrix factorization (NMF) with graph regularization. Though the regularization can be appl...
111
click to vote
ICDM
2010
IEEE
15 years 1 months ago
2010
IEEE
Consider a typical recommendation problem. A company has historical records of products sold to a large customer base. These records may be compactly represented as a sparse custom...
155
click to vote
SIGIR
2011
ACM
14 years 6 months ago
2011
ACM
A key challenge in recommender system research is how to effectively profile new users, a problem generally known as cold-start recommendation. Recently the idea of progressivel...
171
click to vote
SIGIR
2012
ACM
13 years 5 months ago
2012
ACM
In crowdsourced relevance judging, each crowd worker typically judges only a small number of examples, yielding a sparse and imbalanced set of judgments in which relatively few wo...