3395 search results - page 2 / 679 » Learning to efficiently rank |
SIGIR
2010
ACM
13 years 8 months ago
2010
ACM
AI
2008
Springer
13 years 5 months ago
2008
Springer
Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...
ICML
2010
IEEE
13 years 5 months ago
2010
IEEE
We propose a general and efficient algorithm for learning low-rank matrices. The proposed algorithm converges super-linearly and can keep the matrix to be learned in a compact fac...
ICML
1998
IEEE
14 years 5 months ago
1998
IEEE
We study the problem of learning to accurately rank a set of objects by combining a given collection of ranking or preference functions. This problem of combining preferences aris...
COLT
2008
Springer
13 years 6 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...