Sciweavers

266 search results - page 7 / 54
» Parallel learning to rank for information retrieval
Sort
View
SIGIR
2010
ACM
13 years 11 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
CIKM
2004
Springer
14 years 1 months ago
Approximating the top-m passages in a parallel question answering system
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
Charles L. A. Clarke, Egidio L. Terra
ICML
2009
IEEE
14 years 8 months ago
BoltzRank: learning to maximize expected ranking gain
Ranking a set of retrieved documents according to their relevance to a query is a popular problem in information retrieval. Methods that learn ranking functions are difficult to o...
Maksims Volkovs, Richard S. Zemel
CIKM
2005
Springer
13 years 9 months ago
Using RankBoost to compare retrieval systems
This paper presents a new pooling method for constructing the assessment sets used in the evaluation of retrieval systems. Our proposal is based on RankBoost, a machine learning v...
Huyen-Trang Vu, Patrick Gallinari
MIR
2010
ACM
207views Multimedia» more  MIR 2010»
13 years 6 months ago
Learning to rank for content-based image retrieval
In Content-based Image Retrieval (CBIR), accurately ranking the returned images is of paramount importance, since users consider mostly the topmost results. The typical ranking st...
Fabio F. Faria, Adriano Veloso, Humberto Mossri de...