Sciweavers

194 search results - page 14 / 39
» Learning to rank query reformulations
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
PVLDB
2008
131views more  PVLDB 2008»
15 years 1 months ago
Learning to create data-integrating queries
The number of potentially-related data resources available for querying -- databases, data warehouses, virtual integrated schemas -continues to grow rapidly. Perhaps no area has s...
Partha Pratim Talukdar, Marie Jacob, Muhammad Salm...
IR
2010
15 years 6 days ago
LETOR: A benchmark collection for research on learning to rank for information retrieval
LETOR is a benchmark collection for the research on learning to rank for information retrieval, released by Microsoft Research Asia. In this paper, we describe the details of the L...
Tao Qin, Tie-Yan Liu, Jun Xu, Hang Li
116
Voted
VLDB
1990
ACM
116views Database» more  VLDB 1990»
15 years 5 months ago
A Probabilistic Framework for Vague Queries and Imprecise Information in Databases
A probabilistic learning model for vague queries and missing or imprecise information in databases is described. Instead of retrieving only a set of answers, our approach yields a...
Norbert Fuhr
WWW
2011
ACM
14 years 8 months ago
Learning to rank with multiple objective functions
We investigate the problem of learning to rank for document retrieval from the perspective of learning with multiple objective functions. We present solutions to two open problems...
Krysta Marie Svore, Maksims Volkovs, Christopher J...