Improved Affinity Graph Based Multi-Document Summarization

Xiaojun Wan,Jianwu Yang

Published 2006 in North American Chapter of the Association for Computational Linguistics

ABSTRACT

This paper describes an affinity graph based approach to multi-document summarization. We incorporate a diffusion process to acquire semantic relationships between sentences, and then compute information richness of sentences by a graph rank algorithm on differentiated intra-document links and inter-document links between sentences. A 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 task 2 of DUC 2002 and task 2 of DUC 2004 demonstrate that the proposed approach outperforms existing state-of-the-art systems.

PUBLICATION RECORD

  • Publication year

    2006

  • Venue

    North American Chapter of the Association for Computational Linguistics

  • Publication date

    2006-06-04

  • Fields of study

    Computer Science

  • Identifiers
  • External record

    Open on Semantic Scholar

  • Source metadata

    Semantic Scholar

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

CITED BY

Showing 1-100 of 110 citing papers · Page 1 of 2