Sciweavers

395 search results - page 29 / 79
» Learning to rank with partially-labeled data
Sort
View
SIGIR
2010
ACM
15 years 5 months ago
How good is a span of terms?: exploiting proximity to improve web retrieval
Ranking search results is a fundamental problem in information retrieval. In this paper we explore whether the use of proximity and phrase information can improve web retrieval ac...
Krysta Marie Svore, Pallika H. Kanani, Nazan Khan
150
Voted
ICML
2006
IEEE
16 years 2 months ago
MISSL: multiple-instance semi-supervised learning
There has been much work on applying multiple-instance (MI) learning to contentbased image retrieval (CBIR) where the goal is to rank all images in a known repository using a smal...
Rouhollah Rahmani, Sally A. Goldman
ROCAI
2004
Springer
15 years 7 months ago
Learning Interestingness Measures in Terminology Extraction. A ROC-based approach
Abstract. In the field of Text Mining, a key phase in data preparation is concerned with the extraction of terms, i.e. collocation of words attached to specific concepts (e.g. Ph...
Mathieu Roche, Jérôme Azé, Yve...
96
Voted
COLT
2006
Springer
15 years 5 months ago
Ranking with a P-Norm Push
We are interested in supervised ranking with the following twist: our goal is to design algorithms that perform especially well near the top of the ranked list, and are only requir...
Cynthia Rudin
142
Voted
WWW
2011
ACM
14 years 8 months ago
Learning to re-rank: query-dependent image re-ranking using click data
Our objective is to improve the performance of keyword based image search engines by re-ranking their baseline results. To this end, we address three limitations of existing searc...
Vidit Jain, Manik Varma