Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAgrawal A.
dc.contributor.authorGeorge R.A.
dc.contributor.authorRavi S.S.
dc.contributor.authorKamath S.S.
dc.identifier.citationAdvances in Intelligent Systems and Computing , Vol. 1177 , , p. 255 - 263en_US
dc.description.abstractMulti-document summarization (MDS) is a pre-programmed process to excerpt data from various documents regarding similar topics. We aim to employ three techniques for generating summaries from various document collections on the same topic. The first approach is to calculate the importance score for each sentence using features including TF-IDF matrix as well as semantic and syntax similarity. We build our algorithm to sort the sentences by importance and add it to the summary. In the second approach, we use the k-means clustering algorithm for generating the summary. The third approach makes use of the Page Ranking algorithm wherein edges of the graph are formed between sentences that are syntactically similar but are not semantically similar. All these techniques have been used to generate 100–200 word summaries for the DUC 2004 dataset. We use ROUGE scores to evaluate the system-generated summaries with respect to the manually generated summaries. © The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2021.en_US
dc.titleBenchmarking semantic, centroid, and graph-based approaches for multi-document summarizationen_US
dc.typeConference Paperen_US
Appears in Collections:2. Conference Papers

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.