Sciweavers

7215 search results - page 219 / 1443
» On the Consistency of Ranking Algorithms
Sort
View
NIPS
2007
13 years 9 months ago
A General Boosting Method and its Application to Learning Ranking Functions for Web Search
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...
Zhaohui Zheng, Hongyuan Zha, Tong Zhang, Olivier C...
RECSYS
2010
ACM
13 years 8 months ago
Group recommendations with rank aggregation and collaborative filtering
The majority of recommender systems are designed to make recommendations for individual users. However, in some circumstances the items to be selected are not intended for persona...
Linas Baltrunas, Tadas Makcinskas, Francesco Ricci
IFIP12
2010
13 years 6 months ago
Learning the Preferences of News Readers with SVM and Lasso Ranking
We attack the task of predicting which news-stories are more appealing to a given audience by comparing ‘most popular stories’, gathered from various online news outlets, over ...
Elena Hensinger, Ilias N. Flaounas, Nello Cristian...
CC
2010
Springer
120views System Software» more  CC 2010»
13 years 5 months ago
Lower Bounds for Agnostic Learning via Approximate Rank
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
Adam R. Klivans, Alexander A. Sherstov
SIGIR
2011
ACM
12 years 11 months ago
The interactive PRP for diversifying document rankings
The assumptions underlying the Probability Ranking Principle (PRP) have led to a number of alternative approaches that cater or compensate for the PRP’s limitations. In this pos...
Guido Zuccon, Leif Azzopardi, C. J. van Rijsbergen