Sciweavers

395 search results - page 19 / 79
» Learning to rank with partially-labeled data
Sort
View
SIGIR
2009
ACM
15 years 8 months ago
Smoothing clickthrough data for web search ranking
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
Jianfeng Gao, Wei Yuan, Xiao Li, Kefeng Deng, Jian...
94
Voted
RECSYS
2009
ACM
15 years 8 months ago
Collaborative prediction and ranking with non-random missing data
A fundamental aspect of rating-based recommender systems is the observation process, the process by which users choose the items they rate. Nearly all research on collaborative ...
Benjamin M. Marlin, Richard S. Zemel
ICML
2009
IEEE
16 years 2 months ago
Bayesian inference for Plackett-Luce ranking models
This paper gives an efficient Bayesian method for inferring the parameters of a PlackettLuce ranking model. Such models are parameterised distributions over rankings of a finite s...
John Guiver, Edward Snelson
KDD
2012
ACM
187views Data Mining» more  KDD 2012»
13 years 4 months ago
Online learning to diversify from implicit feedback
In order to minimize redundancy and optimize coverage of multiple user interests, search engines and recommender systems aim to diversify their set of results. To date, these dive...
Karthik Raman, Pannaga Shivaswamy, Thorsten Joachi...
130
Voted
NIPS
2003
15 years 3 months ago
Log-Linear Models for Label Ranking
Label ranking is the task of inferring a total order over a predefined set of labels for each given instance. We present a general framework for batch learning of label ranking f...
Ofer Dekel, Christopher D. Manning, Yoram Singer