Towards a Unified Approach Based on Affinity Graph to Various Multi-document Summarizations

  • Xiaojun Wan
  • Jianguo Xiao
Conference paper

DOI: 10.1007/978-3-540-74851-9_25

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4675)
Cite this paper as:
Wan X., Xiao J. (2007) Towards a Unified Approach Based on Affinity Graph to Various Multi-document Summarizations. In: Kovács L., Fuhr N., Meghini C. (eds) Research and Advanced Technology for Digital Libraries. ECDL 2007. Lecture Notes in Computer Science, vol 4675. Springer, Berlin, Heidelberg

Abstract

This paper proposes a unified extractive approach based on affinity graph to both generic and topic-focused multi-document summarizations. By using an asymmetric similarity measure, the relationships between sentences are reflected in a directed affinity graph for generic summarization. For topic-focused summarization, the topic information is incorporated into the affinity graph using a topic-sensitive affinity measure. Based on the affinity graph, the information richness of sentences is computed by the graph-ranking algorithm on differentiated intra-document links and inter-document links between sentences. Lastly, the greedy algorithm is employed to impose diversity penalty on sentences and the sentences with both high information richness and high information novelty are chosen into the summary. Experimental results on the tasks of DUC 2002-2005 demonstrate the excellent performances of the proposed approaches to both generic and topic-focused multi-document summarization tasks.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Xiaojun Wan
    • 1
  • Jianguo Xiao
    • 1
  1. 1.Institute of Computer Science and Technology, Peking University, Beijing 100871China

Personalised recommendations