Sciweavers

8 search results - page 1 / 2
» Loss Bounds for Online Category Ranking
Sort
View
COLT
2005
Springer
13 years 5 months ago
Loss Bounds for Online Category Ranking
Category ranking is the task of ordering labels with respect to their relevance to an input instance. In this paper we describe and analyze several algorithms for online category r...
Koby Crammer, Yoram Singer
SIGIR
2002
ACM
13 years 3 months ago
A new family of online algorithms for category ranking
We describe a new family of topic-ranking algorithms for multi-labeled documents. The motivation for the algorithms stems from recent advances in online learning algorithms. The a...
Koby Crammer, Yoram Singer
SIGIR
2008
ACM
13 years 3 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
SIGIR
2008
ACM
13 years 3 months ago
Query dependent ranking using K-nearest neighbor
Many ranking models have been proposed in information retrieval, and recently machine learning techniques have also been applied to ranking model construction. Most of the existin...
Xiubo Geng, Tie-Yan Liu, Tao Qin, Andrew Arnold, H...
CIKM
2009
Springer
13 years 8 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,...