The two-stage unsupervised approach to multidocument summarization
- 1 October 2009
- journal article
- Published by Allerton Press in Automatic Control and Computer Sciences
- Vol. 43 (5) , 276-284
Abstract
This paper suggests an approach for creating a summary for a set of documents with revealing the topics and extracting informative sentences. The topics are determined through clustering of sentences, and the informative sentences are extracted using the ranking algorithm. The result of the summarization has been shown depends on the clustering method, the ranking algorithm, and the similarity measure. The experiments on an open benchmark datasets DUC2001 and DUC2002 have showed that the suggested clustering methods and the ranking algorithm show better results than the known k-means method and the ranking algorithms PageRank and HITS.Keywords
This publication has 18 references indexed in Scilit:
- A complex network approach to text summarizationInformation Sciences, 2009
- Biased LexRank: Passage retrieval using random walks with question-based priorsInformation Processing & Management, 2009
- Personalized PageRank Based Multi-document Summarization2008
- GSPSummary: A Graph-Based Sub-topic Partition Algorithm for Summarization2008
- Multi-candidate reduction: Sentence compression as a tool for document summarization tasksInformation Processing & Management, 2007
- Automatic summarising: The state of the artInformation Processing & Management, 2007
- Satisfying information needs with multi-document summariesInformation Processing & Management, 2007
- A new web page summarization method2006
- Generic technologies for single- and multi-document summarizationInformation Processing & Management, 2005
- LexRank: Graph-based Lexical Centrality as Salience in Text SummarizationJournal of Artificial Intelligence Research, 2004