2008 International Symposiums on Information Processing A Query-Sensitive Graph-Based Sentence Ranking Algorithm for Query-Oriented Multi-document Summarization May 23-May 25 ISBN: 978-0-7695-3151-9
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISIP.2008.21
Graph-based models and ranking algorithms have been drawn considerable attentions from the document summarization community in the recent years. However, in regard to query-oriented summarization, the influence of the query has been limited to the sentence nodes in the previous graph models. We argue that other than the sentence nodes the sentence-sentence edges should also be measured in accordance with the given query. In this paper, we develop a query-sensitive similarity measure that incorporates the query influence into the evaluation of sentence-sentence edges for graph-based query-oriented summarization. Furthermore, in order to cope with the multi-document summarization task, we explicitly distinguish the inter-document sentence relations from the intra-document sentence relations and emphasize the influence of global information from the document set on local sentence evaluation. Experimental results on DUC 2005 dataset are quite promising and motivate us to further investigate query-sensitive similarity measures.
Index Terms:
query-sensitive similarity, graph based summarization, query-oriented summarization, ranking algorithm
Citation:
Furu Wei, Yanxiang He, Wenjie Li, Qin Lu, "A Query-Sensitive Graph-Based Sentence Ranking Algorithm for Query-Oriented Multi-document Summarization," isip, pp.9-13, 2008 International Symposiums on Information Processing, 2008 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||