Sciweavers

2018 search results - page 127 / 404
» Magnitude-preserving ranking algorithms
Sort
View
NIPS
2007
15 years 7 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...
IKE
2003
15 years 7 months ago
A Tree-Based inverted File for Fast Ranked-Document Retrieval
Inverted files are widely used to index documents in large-scale information retrieval systems. An inverted file consists of posting lists, which can be stored in either a documen...
Wann-Yun Shieh, Tien-Fu Chen, Chung-Ping Chung
RECSYS
2010
ACM
15 years 6 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
15 years 4 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»
15 years 3 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