Sciweavers

888 search results - page 17 / 178
» Learning to Select a Ranking Function
Sort
View
CIKM
2009
Springer
15 years 4 months ago
Feature selection for ranking using boosted trees
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
Feng Pan, Tim Converse, David Ahn, Franco Salvetti...
NIPS
2003
14 years 11 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
90
Voted
CC
2010
Springer
120views System Software» more  CC 2010»
14 years 7 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
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...
85
Voted
SIGIR
2006
ACM
15 years 3 months ago
Adapting ranking SVM to document retrieval
The paper is concerned with applying learning to rank to document retrieval. Ranking SVM is a typical method of learning to rank. We point out that there are two factors one must ...
Yunbo Cao, Jun Xu, Tie-Yan Liu, Hang Li, Yalou Hua...