2100 search results - page 303 / 420 » Learning to rank on graphs |
158
click to vote
ACL
2007
15 years 8 months ago
2007
Even in a massive corpus such as the Web, a substantial fraction of extractions appear infrequently. This paper shows how to assess the correctness of sparse extractions by utiliz...
156
click to vote
TREC
2004
15 years 8 months ago
2004
While participating in the HARD track our first question was, what an IR-application should look like that takes into account preference meta-data from the user, without the need ...
185
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Clickthrough data is a particularly inexpensive and plentiful resource to obtain implicit relevance feedback for improving and personalizing search engines. However, it is well kn...
132
click to vote
SIGIR
2008
ACM
15 years 6 months ago
2008
ACM
There has been recent interest in collecting user or assessor preferences, rather than absolute judgments of relevance, for the evaluation or learning of ranking algorithms. Since...
145
click to vote
IR
2007
15 years 6 months ago
2007
In information retrieval, the cluster hypothesis states: closely related documents tend to be relevant to the same request. We exploit this hypothesis directly by adjusting queryb...