Sciweavers

538 search results - page 5 / 108
» Context-sensitive ranking for document retrieval
Sort
View
SIGIR
2005
ACM
15 years 10 months ago
Controlling overlap in content-oriented XML retrieval
The direct application of standard ranking techniques to retrieve individual elements from a collection of XML documents often produces a result set in which the top ranks are dom...
Charles L. A. Clarke
SIGIR
2008
ACM
15 years 4 months ago
Re-ranking search results using document-passage graphs
We present a novel passage-based approach to re-ranking documents in an initially retrieved list so as to improve precision at top ranks. While most work on passage-based document...
Michael Bendersky, Oren Kurland
ECIR
2009
Springer
16 years 1 months ago
Risk-Aware Information Retrieval
Probabilistic retrieval models usually rank documents based on a scalar quantity. However, such models lack any estimate for the uncertainty associated with a document’s rank. Fu...
Jianhan Zhu, Jun Wang, Michael J. Taylor, Ingemar ...
ICTIR
2009
Springer
15 years 11 months ago
The Quantum Probability Ranking Principle for Information Retrieval
Abstract. While the Probability Ranking Principle for Information Retrieval provides the basis for formal models, it makes a very strong assumption regarding the dependence between...
Guido Zuccon, Leif Azzopardi, Keith van Rijsbergen
SIGMOD
2011
ACM
219views Database» more  SIGMOD 2011»
14 years 7 months ago
Context-sensitive ranking for document retrieval
We study the problem of context-sensitive ranking for document retrieval, where a context is defined as a sub-collection of documents, and is specified by queries provided by do...
Liang Jeff Chen, Yannis Papakonstantinou