16 search results - page 2 / 4 » Pseudo test collections for learning web search ranking func... |
ICML
1998
IEEE
14 years 10 months ago
1998
IEEE
We study the problem of learning to accurately rank a set of objects by combining a given collection of ranking or preference functions. This problem of combining preferences aris...
CIKM
2010
Springer
13 years 8 months ago
2010
Springer
Traditional machine-learned ranking algorithms for web search are trained in batch mode, which assume static relevance of documents for a given query. Although such a batch-learni...
WSDM
2012
ACM
12 years 5 months ago
2012
ACM
Many vertical search tasks such as local search focus on specific domains. The meaning of relevance in these verticals is domain-specific and usually consists of multiple well-d...
SIGIR
2010
ACM
14 years 1 months ago
2010
ACM
Interleaving experiments are an attractive methodology for evaluating retrieval functions through implicit feedback. Designed as a blind and unbiased test for eliciting a preferen...
GISCIENCE
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. The SPIRIT search engine provides a test bed for the development of web search technology that is specialised for access to geographical information. Major components inc...