Sciweavers

806 search results - page 44 / 162
» Context-sensitive document ranking
Sort
View
116
Voted
SIGIR
2011
ACM
14 years 3 months ago
Ad hoc IR: not much room for improvement
Ranking function performance reached a plateau in 1994. The reason for this is investigated. First the performance of BM25 is measured as the proportion of queries satisfied on th...
Andrew Trotman, David Keeler
85
Voted
WSDM
2010
ACM
210views Data Mining» more  WSDM 2010»
15 years 10 months ago
Towards Recency Ranking in Web Search
In web search, recency ranking refers to ranking documents by relevance which takes freshness into account. In this paper, we propose a retrieval system which automatically detect...
Anlei Dong, Yi Chang, Zhaohui Zheng, Gilad Mishne,...
105
Voted
SIGIR
2009
ACM
15 years 7 months ago
Smoothing clickthrough data for web search ranking
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
Jianfeng Gao, Wei Yuan, Xiao Li, Kefeng Deng, Jian...
HIPC
2007
Springer
15 years 6 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...
92
Voted
CIKM
2006
Springer
15 years 4 months ago
Ranking robustness: a novel framework to predict query performance
In this paper, we introduce the notion of ranking robustness, which refers to a property of a ranked list of documents that indicates how stable the ranking is in the presence of ...
Yun Zhou, W. Bruce Croft