Sciweavers

30 search results - page 4 / 6
» Query-level loss functions for information retrieval
Sort
View
CIKM
2009
Springer
13 years 10 months ago
Heterogeneous cross domain ranking in latent space
Traditional ranking mainly focuses on one type of data source, and effective modeling still relies on a sufficiently large number of labeled or supervised examples. However, in m...
Bo Wang, Jie Tang, Wei Fan, Songcan Chen, Zi Yang,...
ECML
2006
Springer
13 years 9 months ago
Cost-Sensitive Learning of SVM for Ranking
Abstract. In this paper, we propose a new method for learning to rank. `Ranking SVM' is a method for performing the task. It formulizes the problem as that of binary classific...
Jun Xu, Yunbo Cao, Hang Li, Yalou Huang
WSDM
2010
ACM
211views Data Mining» more  WSDM 2010»
13 years 11 months ago
IntervalRank - Isotonic Regression with Listwise and Pairwise Constraints
Ranking a set of retrieved documents according to their relevance to a given query has become a popular problem at the intersection of web search, machine learning, and informatio...
Taesup Moon, Alex Smola, Yi Chang, Zhaohui Zheng
SIGIR
2002
ACM
13 years 5 months ago
Risk minimization and language modeling in text retrieval dissertation abstract
tion Abstract ChengXiang Zhai (Advisor: John Lafferty) Language Technologies Institute School of Computer Science Carnegie Mellon University With the dramatic increase in online in...
ChengXiang Zhai
SIGIR
2008
ACM
13 years 6 months ago
Directly optimizing evaluation measures in learning to rank
One of the central issues in learning to rank for information retrieval is to develop algorithms that construct ranking models by directly optimizing evaluation measures used in i...
Jun Xu, Tie-Yan Liu, Min Lu, Hang Li, Wei-Ying Ma