TY - GEN
T1 - Probabilistic models for personalizing Web search
AU - Sontag, David
AU - Collins-Thompson, Kevyn
AU - Bennett, Paul N.
AU - White, Ryen W.
AU - Dumais, Susan
AU - Billerbeck, Bodo
N1 - Copyright:
Copyright 2012 Elsevier B.V., All rights reserved.
PY - 2012
Y1 - 2012
N2 - We present a new approach for personalizing Web search results to a specific user. Ranking functions for Web search engines are typically trained by machine learning algorithms using either direct human relevance judgments or indirect judgments obtained from click-through data from millions of users. The rankings are thus optimized to this generic population of users, not to any specific user. We propose a generative model of relevance which can be used to infer the relevance of a document to a specific user for a search query. The user-specific parameters of this generative model constitute a compact user profile. We show how to learn these profiles from a user's long-term search history. Our algorithm for computing the personalized ranking is simple and has little computational overhead. We evaluate our personalization approach using historical search data from thousands of users of a major Web search engine. Our findings demonstrate gains in retrieval performance for queries with high ambiguity, with particularly large improvements for acronym queries.
AB - We present a new approach for personalizing Web search results to a specific user. Ranking functions for Web search engines are typically trained by machine learning algorithms using either direct human relevance judgments or indirect judgments obtained from click-through data from millions of users. The rankings are thus optimized to this generic population of users, not to any specific user. We propose a generative model of relevance which can be used to infer the relevance of a document to a specific user for a search query. The user-specific parameters of this generative model constitute a compact user profile. We show how to learn these profiles from a user's long-term search history. Our algorithm for computing the personalized ranking is simple and has little computational overhead. We evaluate our personalization approach using historical search data from thousands of users of a major Web search engine. Our findings demonstrate gains in retrieval performance for queries with high ambiguity, with particularly large improvements for acronym queries.
KW - Machine learning
KW - Personalization
KW - Probabilistic models
KW - Re-ranking
UR - http://www.scopus.com/inward/record.url?scp=84858033182&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84858033182&partnerID=8YFLogxK
U2 - 10.1145/2124295.2124348
DO - 10.1145/2124295.2124348
M3 - Conference contribution
AN - SCOPUS:84858033182
SN - 9781450307475
T3 - WSDM 2012 - Proceedings of the 5th ACM International Conference on Web Search and Data Mining
SP - 433
EP - 442
BT - WSDM 2012 - Proceedings of the 5th ACM International Conference on Web Search and Data Mining
T2 - 5th ACM International Conference on Web Search and Data Mining, WSDM 2012
Y2 - 8 February 2012 through 12 February 2012
ER -