1068 search results - page 31 / 214 » Factorization as a Rank 1 Problem |
KDD
2009
ACM
15 years 4 months ago
2009
ACM
Human computation is an effective way to channel human effort spent playing games to solving computational problems that are easy for humans but difficult for computers to autom...
COLT
2008
Springer
14 years 11 months ago
2008
Springer
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
SIAMSC
2010
14 years 8 months ago
2010
We present a new iterative scheme for PageRank computation. The algorithm is applied to the linear system formulation of the problem, using inner-outer stationary iterations. It is...
ICDM
2008
IEEE
15 years 4 months ago
2008
IEEE
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...