2018 search results - page 110 / 404 » Magnitude-preserving ranking algorithms |
179
click to vote
CIKM
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of learning to rank relevant and novel documents so as to directly maximize a performance metric called Expected Global Utility (EGU), which has several de...
191
click to vote
WWW
2011
ACM
15 years 1 months ago
2011
ACM
We investigate the problem of learning to rank for document retrieval from the perspective of learning with multiple objective functions. We present solutions to two open problems...
203
click to vote
PVLDB
2011
15 years 1 months ago
2011
Studies find that at least 20% of web queries have local intent; and the fraction of queries with local intent that originate from mobile properties may be twice as high. The eme...
195
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
165
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We study a problem of quick detection of top-k Personalized PageRank lists. This problem has a number of important applications such as finding local cuts in large graphs, estima...