Learning to rank with selection bias in personal search

X Wang, M Bendersky, D Metzler… - Proceedings of the 39th …, 2016 - dl.acm.org
Click-through data has proven to be a critical resource for improving search ranking quality.
Though a large amount of click data can be easily collected by search engines, various …

Smoothing clickthrough data for web search ranking

J Gao, W Yuan, X Li, K Deng, JY Nie - Proceedings of the 32nd …, 2009 - dl.acm.org
Incorporating features extracted from clickthrough data (called clickthrough features) has
been demonstrated to significantly improve the performance of ranking models for Web …

Position bias estimation for unbiased learning to rank in personal search

X Wang, N Golbandi, M Bendersky, D Metzler… - Proceedings of the …, 2018 - dl.acm.org
A well-known challenge in learning from click data is its inherent bias and most notably
position bias. Traditional click models aim to extract the‹ query, document› relevance and …

Are click-through data adequate for learning web search rankings?

Z Dou, R Song, X Yuan, JR Wen - … of the 17th ACM conference on …, 2008 - dl.acm.org
Learning-to-rank algorithms, which can automatically adapt ranking functions in web search,
require a large volume of training data. A traditional way of generating training examples is …

Unbiased learning to rank with unbiased propensity estimation

Q Ai, K Bi, C Luo, J Guo, WB Croft - The 41st international ACM SIGIR …, 2018 - dl.acm.org
Learning to rank with biased click data is a well-known challenge. A variety of methods has
been explored to debias click data for learning to rank such as click models, result …

Learning to rank for information retrieval

TY Liu - Foundations and Trends® in Information Retrieval, 2009 - nowpublishers.com
Learning to rank for Information Retrieval (IR) is a task to automatically construct a ranking
model using training data, such that the model can sort new objects according to their …

Query chains: learning to rank from implicit feedback

F Radlinski, T Joachims - Proceedings of the eleventh ACM SIGKDD …, 2005 - dl.acm.org
This paper presents a novel approach for using clickthrough data to learn ranked retrieval
functions for web search results. We observe that users searching the web often perform a …

The whens and hows of learning to rank for web search

C Macdonald, RLT Santos, I Ounis - Information Retrieval, 2013 - Springer
Web search engines are increasingly deploying many features, combined using learning to
rank techniques. However, various practical questions remain concerning the manner in …

Reusing historical interaction data for faster online learning to rank for IR

K Hofmann, A Schuth, S Whiteson… - Proceedings of the sixth …, 2013 - dl.acm.org
Online learning to rank for information retrieval (IR) holds promise for allowing the
development of" self-learning" search engines that can automatically adjust to their users …

[HTML][HTML] Balancing exploration and exploitation in listwise and pairwise online learning to rank for information retrieval

K Hofmann, S Whiteson, M de Rijke - Information Retrieval, 2013 - Springer
As retrieval systems become more complex, learning to rank approaches are being
developed to automatically tune their parameters. Using online learning to rank, retrieval …