Sciweavers

82 search results - page 4 / 17
» Learning a ranking from pairwise preferences
Sort
View
CIKM
2008
Springer
13 years 8 months ago
Are click-through data adequate for learning web search rankings?
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 examp...
Zhicheng Dou, Ruihua Song, Xiaojie Yuan, Ji-Rong W...
ICDE
2008
IEEE
189views Database» more  ICDE 2008»
14 years 21 days ago
Adapting ranking functions to user preference
— Learning to rank has become a popular method for web search ranking. Traditionally, expert-judged examples are the major training resource for machine learned web ranking, whic...
Keke Chen, Ya Zhang, Zhaohui Zheng, Hongyuan Zha, ...
AIRS
2010
Springer
13 years 4 months ago
Learning to Rank with Supplementary Data
This paper is concerned with a new task of ranking, referred to as "supplementary data assisted ranking", or "supplementary ranking" for short. Different from c...
Wenkui Ding, Tao Qin, Xu-Dong Zhang
KDD
2008
ACM
147views Data Mining» more  KDD 2008»
14 years 6 months ago
Structured learning for non-smooth ranking losses
Learning to rank from relevance judgment is an active research area. Itemwise score regression, pairwise preference satisfaction, and listwise structured learning are the major te...
Soumen Chakrabarti, Rajiv Khanna, Uma Sawant, Chir...
KDD
2005
ACM
177views Data Mining» more  KDD 2005»
14 years 6 months ago
Query chains: learning to rank from implicit feedback
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 ...
Filip Radlinski, Thorsten Joachims