Name
Abstract | ||
|---|---|---|
Evaluating the quality of ranking functions is a core task in web search and other information retrieval domains. Because query distributions and item relevance change over time, ranking models often cannot be evaluated accurately on held-out training data. Instead, considerable effort is spent on manually labeling the relevance of query results for test queries in order to track ranking performance. We address the problem of estimating ranking performance as accurately as possible on a fixed labeling budget. Estimates are based on a set of most informative test queries selected by an active sampling distribution. Query labeling costs depend on the number of result items and item-specific attributes such as document length. We derive cost-optimal sampling distributions for commonly used ranking performance measures. Experiments on web search engine data illustrate significant reductions in labeling costs. |
Year | Venue | Keywords |
|---|---|---|
2013 | IJCAI | cost-optimal sampling distribution,ranking function,ranking performance measure,active sampling distribution,graded relevance,ranking performance,test query,query result,query distribution,active evaluation,held-out training data,ranking model |
Field | DocType | Citations |
Web search engine,Training set,Sampling distribution,Data mining,Information retrieval,Ranking SVM,Ranking,Computer science,Ranking (information retrieval) | Conference | 0 |
PageRank | References | Authors |
0.34 | 12 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christoph Sawade | 1 | 55 | 6.21 |
| Steffen Bickel | 2 | 848 | 58.84 |
| Timo Von Oertzen | 3 | 71 | 7.84 |
| Tobias Scheffer | 4 | 1862 | 139.64 |
| Niels Landwehr | 5 | 506 | 31.54 |