论文信息 - Learning to rank under tight budget constraints

Learning to rank under tight budget constraints

This paper investigates the influence of pruning feature lists to keep a given budget for the evaluation of ranking methods. We learn from a given training set how important the individual prefixes are for the ranking quality. Based on there importance we choose the best prefixes to calculate the ranking while keeping the budget.

Ralf Schenkel | Christian Pölitz

[1] Prabhakant Sinha,et al. The Multiple-Choice Knapsack Problem , 1979, Oper. Res..

[2] Gerhard Weikum,et al. Best-Effort Top-k Query Processing Under Budgetary Constraints , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[3] Ihab F. Ilyas,et al. A survey of top-k query processing techniques in relational database systems , 2008, CSUR.

[4] Jimmy J. Lin,et al. Ranking under temporal constraints , 2010, CIKM.

[5] W. Bruce Croft,et al. Learning concept importance using a weighted dependence model , 2010, WSDM '10.

[6] JUSTIN ZOBEL,et al. Inverted files for text search engines , 2006, CSUR.