Density-based graph model summarization: Attaining better performance and efficiency

• Type: Article in International Scientific Journal
• Date: 2015

Authors

Valizadeh, M (Author) Other; Pavel Brazdil (Author) FEP

Journal

Title: Intelligent Data Analysis

Vol. 19

Pages: 617-629

ISSN: 1088-467X

Publisher: IOS PRESS

Indexing

ISI Web of Knowledge - 1 Citation

Scopus - 1 Citation

Other information

Authenticus ID: P-00G-BSZ

DOI: 10.3233/ida-150735

Abstract (EN): Several algorithms based on PageRank algorithm have been proposed to rank the document sentences in the multi-document summarization field and LexRank and T-LexRank algorithms are well known examples. In literature different concepts such as weighted inter-cluster edge, cluster-sensitive graph model and document-sensitive graph model have been proposed to improve LexRank and T-LexRank algorithms (e.g. DsR-G, DsR-Q) for multi-document summarization. In this paper, a density-based graph model for multi-document summarization is proposed by adding the concept of density to LexRank and T-LexRank algorithms. The resulting generic multi-document summarization systems, DensGS and DensGSD were evaluated on DUC 2004 while the query-based variants, DensQS, DensQSD were evaluated on DUC 2006, DUC 2007 and TAC 2010 task A. ROUGE measure was used in the evaluation. Experimental results show that density concept improves LexRank and T-LexRank algorithms and outperforms previous graph-based models (DsR-G and DsR-Q) in generic and query-based multi-document summarization tasks. Furthermore, the comparison of the number of iterations indicates that the density-based algorithm is faster than the other algorithms based on PageRank.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 13