Sciweavers

451 search results - page 8 / 91
» Mining clickthrough data for collaborative web search
Sort
View
WSDM
2012
ACM
285views Data Mining» more  WSDM 2012»
13 years 5 months ago
Probabilistic models for personalizing web search
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 u...
David Sontag, Kevyn Collins-Thompson, Paul N. Benn...
85
Voted
WWW
2005
ACM
15 years 10 months ago
CubeSVD: a novel approach to personalized Web search
As the competition of Web search market increases, there is a high demand for personalized Web search to conduct retrieval incorporating Web users' information needs. This pa...
Jian-Tao Sun, Hua-Jun Zeng, Huan Liu, Yuchang Lu, ...
WWW
2009
ACM
15 years 10 months ago
A dynamic bayesian network click model for web search ranking
As with any application of machine learning, web search ranking requires labeled data. The labels usually come in the form of relevance assessments made by editors. Click logs can...
Olivier Chapelle, Ya Zhang
NAACL
2010
14 years 7 months ago
Query Ambiguity Revisited: Clickthrough Measures for Distinguishing Informational and Ambiguous Queries
Understanding query ambiguity in web search remains an important open problem. In this paper we reexamine query ambiguity by analyzing the result clickthrough data. Previously pro...
Yu Wang, Eugene Agichtein