Using query expansion in graph-based approach for query-focused multi-document summarization

作者:

Highlights:

摘要

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.

论文关键词:Query-focused summarization,Query expansion,Graph-based ranking

论文评审过程:Received 28 February 2008, Revised 27 June 2008, Accepted 5 July 2008, Available online 26 August 2008.

论文官网地址:https://doi.org/10.1016/j.ipm.2008.07.001