Journal
INFORMATION PROCESSING & MANAGEMENT
Volume 45, Issue 1, Pages 35-41Publisher
ELSEVIER SCI LTD
DOI: 10.1016/j.ipm.2008.07.001
Keywords
Query-focused summarization; Query expansion; Graph-based ranking
Funding
- Natural Science Foundation of China [60435020]
- Committee of Science and Technology of Shanghai Municipal Government
Ask authors/readers for more resources
This paper presents a novel query expansion method, which is combined in the graph-based algorithm for query-focused multi-document summarization, so as to resolve the problem of information limit in the original query. Our approach makes use of both the sentence-to-sentence relations and the sentence-to-word relations to select the query biased informative words from the document set and use them as query expansions to improve the sentence ranking result. Compared to previous query expansion approaches, our approach can capture more relevant information with less noise. We performed experiments on the data of document understanding conference (DUC) 2005 and DUC 2006, and the evaluation results show that the proposed query expansion method can significantly improve the system performance and make our system comparable to the state-of-the-art systems. (C) 2008 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available