Sciweavers

266 search results - page 20 / 54
» Parallel learning to rank for information retrieval
Sort
View
SIGIR
2011
ACM
12 years 10 months ago
Pseudo test collections for learning web search ranking functions
Test collections are the primary drivers of progress in information retrieval. They provide a yardstick for assessing the effectiveness of ranking functions in an automatic, rapi...
Nima Asadi, Donald Metzler, Tamer Elsayed, Jimmy L...
SIGIR
2011
ACM
12 years 10 months ago
Learning to rank from a noisy crowd
We study how to best use crowdsourced relevance judgments learning to rank [1, 7]. We integrate two lines of prior work: unreliable crowd-based binary annotation for binary classi...
Abhimanu Kumar, Matthew Lease
HIPC
2007
Springer
14 years 1 months ago
Distributed Ranked Search
P2P deployments are a natural infrastructure for building distributed search networks. Proposed systems support locating and retrieving all results, but lack the information necess...
Vijay Gopalakrishnan, Ruggero Morselli, Bobby Bhat...
SODA
2007
ACM
145views Algorithms» more  SODA 2007»
13 years 9 months ago
Aggregation of partial rankings, p-ratings and top-m lists
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam fighting, e-c...
Nir Ailon
CIKM
2008
Springer
13 years 9 months ago
Suppressing outliers in pairwise preference ranking
Many of the recently proposed algorithms for learning feature-based ranking functions are based on the pairwise preference framework, in which instead of taking documents in isola...
Vitor R. Carvalho, Jonathan L. Elsas, William W. C...