ACM Home Page
Please provide us with feedback. Feedback
Discriminative probabilistic models for passage based retrieval
Full text PdfPdf (250 KB)
Source
Annual ACM Conference on Research and Development in Information Retrieval archive
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval table of contents
Singapore, Singapore
SESSION: Probabilistic models table of contents
Pages 419-426  
Year of Publication: 2008
ISBN:978-1-60558-164-4
Authors
Mengqiu Wang  Stanford University, Stanford, CA, USA
Luo Si  Purdue University, West Lafayette, IN, USA
Sponsors
ACM: Association for Computing Machinery
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 24,   Downloads (12 Months): 241,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1390334.1390407
What is a DOI?

ABSTRACT

The approach of using passage-level evidence for document retrieval has shown mixed results when it is applied to a variety of test beds with different characteristics. One main reason of the inconsistent performance is that there exists no unified framework to model the evidence of individual passages within a document. This paper proposes two probabilistic models to formally model the evidence of a set of top ranked passages in a document. The first probabilistic model follows the retrieval criterion that a document is relevant if any passage in the document is relevant, and models each passage independently. The second probabilistic model goes a step further and incorporates the similarity correlations among the passages. Both models are trained in a discriminative manner. Furthermore, we present a combination approach to combine the ranked lists of document retrieval and passage-based retrieval.

An extensive set of experiments have been conducted on four different TREC test beds to show the effectiveness of the proposed discriminative probabilistic models for passage-based retrieval. The proposed algorithms are compared with a state-of-the-art document retrieval algorithm and a language model approach for passage-based retrieval. Furthermore, our combined approach has been shown to provide better results than both document retrieval and passage-based retrieval approaches.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
 
4
5
 
6
D. J. Harper. Relevance Feedback in Document Retrieval Systems: An Evaluation of Probabilistic Strategies. PhD thesis, Cambridge University, 1980.
7
 
8
 
9
N. A. Jaleel, A. Corrada-Emmanuel, Q. Li, X. Liu, C. Wade, and J. Allan. Umass at trec 2003: Hard and qa. In Proc. of TREC-12, 2003.
10
 
11
 
12
 
13
D. Knaus, E. Mittendorf, and P. Schauble. Improving a basic retrieval method by links and passage level evidence. In Proc. of TREC-3, 1994.
14
15
16
 
17
 
18
19
20
21
 
22
C. Wade and J. Allan. Passage retrieval and evaluation. Technical report, CIIR, University of Massachusetts, 2005.
 
23
 
24
W. Xi, R. Xu-Rong, C. S. Khoo, and E.-P. Lim. Incorporating window-based passage-level evidence in document retrieval. JIS, 27(2):73--80, 2001.
 
25