Sciweavers

2100 search results - page 57 / 420
» Learning to rank on graphs
Sort
View
CIKM
2008
Springer
14 years 11 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...
WSDM
2010
ACM
245views Data Mining» more  WSDM 2010»
15 years 7 months ago
Improving Quality of Training Data for Learning to Rank Using Click-Through Data
In information retrieval, relevance of documents with respect to queries is usually judged by humans, and used in evaluation and/or learning of ranking functions. Previous work ha...
Jingfang Xu, Chuanliang Chen, Gu Xu, Hang Li, Elbi...
ECML
2006
Springer
15 years 1 months ago
Case-Based Label Ranking
Label ranking studies the problem of learning a mapping from instances to rankings over a predefined set of labels. We approach this setting from a case-based perspective and propo...
Klaus Brinker, Eyke Hüllermeier
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
15 years 10 months ago
Active exploration for learning rankings from clickthrough data
We address the task of learning rankings of documents from search engine logs of user behavior. Previous work on this problem has relied on passively collected clickthrough data. ...
Filip Radlinski, Thorsten Joachims
ICML
2008
IEEE
15 years 10 months ago
Listwise approach to learning to rank: theory and algorithm
This paper aims to conduct a study on the listwise approach to learning to rank. The listwise approach learns a ranking function by taking individual lists as instances and minimi...
Fen Xia, Tie-Yan Liu, Jue Wang, Wensheng Zhang, Ha...