Clusterrank: a graph based method for meeting summarization

Citations Over TimeTop 10% of 2009 papers

Abstract

This paper presents an unsupervised, graph based approach for extractive summarization of meetings. Graph based methods such as TextRank have been used for sentence extraction from news articles. These methods model text as a graph with sentences as nodes and edges based on word overlap. A sentence node is then ranked according to its similarity with other nodes. The spontaneous speech in meetings leads to incomplete, informed sentences with high redundancy and calls for additional measures to extract relevant sentences. We propose an extension of the TextRank algorithm that clusters the meeting utterances and uses these clusters to construct the graph. We evaluate this method on the AM I meeting corpus and show a significant improvement over TextRank and other baseline methods.

Related Papers

• → An overview of Text Summarization techniques(2016)91 cited
• → An idea based on sequential pattern mining and deep learning for text summarization(2019)8 cited
• → Chinese Text Classification Based on Summarization Technique(2007)3 cited
• → Introducing Word's Importance Level-Based Text Summarization Using Tree Structure(2019)1 cited
• → Chinese Text Classification Based on Summarization Technique(2007)1 cited