Sciweavers

812 search results - page 126 / 163
» Preference-based learning to rank
Sort
View
CORR
2006
Springer
118views Education» more  CORR 2006»
13 years 8 months ago
Minimally Invasive Randomization for Collecting Unbiased Preferences from Clickthrough Logs
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...
Filip Radlinski, Thorsten Joachims
SIGIR
2008
ACM
13 years 8 months ago
Evaluation measures for preference judgments
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...
Ben Carterette, Paul N. Bennett
IR
2007
13 years 8 months ago
Regularizing query-based retrieval scores
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...
Fernando Diaz
EMNLP
2010
13 years 6 months ago
Unsupervised Parse Selection for HPSG
Parser disambiguation with precision grammars generally takes place via statistical ranking of the parse yield of the grammar using a supervised parse selection model. In the stan...
Rebecca Dridan, Timothy Baldwin
COLING
2010
13 years 3 months ago
An Empirical Study on Web Mining of Parallel Data
This paper1 presents an empirical approach to mining parallel corpora. Conventional approaches use a readily available collection of comparable, nonparallel corpora to extract par...
Gum-Won Hong, Chi-Ho Li, Ming Zhou, Hae-Chang Rim