Sciweavers

302 search results - page 14 / 61
» Smoothing clickthrough data for web search ranking
Sort
View
KDD
2009
ACM
245views Data Mining» more  KDD 2009»
16 years 7 months ago
Mining rich session context to improve web search
User browsing information, particularly their non-search related activity, reveals important contextual information on the preferences and the intent of web users. In this paper, ...
Guangyu Zhu, Gilad Mishne
AAAI
2007
15 years 9 months ago
Aggregating User-Centered Rankings to Improve Web Search
This paper is to investigate rank aggregation based on multiple user-centered measures in the context of the web search. We introduce a set of techniques to combine ranking lists ...
Lin Li, Zhenglu Yang, Masaru Kitsuregawa
EMNLP
2009
15 years 4 months ago
Model Adaptation via Model Interpolation and Boosting for Web Search Ranking
This paper explores two classes of model adaptation methods for Web search ranking: Model Interpolation and error-driven learning approaches based on a boosting algorithm. The res...
Jianfeng Gao, Qiang Wu, Chris Burges, Krysta Marie...
SIGIR
2010
ACM
15 years 10 months ago
Context-aware ranking in web search
The context of a search query often provides a search engine meaningful hints for answering the current query better. Previous studies on context-aware search were either focused ...
Biao Xiang, Daxin Jiang, Jian Pei, Xiaohui Sun, En...
WWW
2011
ACM
15 years 1 months ago
Parallel boosted regression trees for web search ranking
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
Stephen Tyree, Kilian Q. Weinberger, Kunal Agrawal...