The Power of Pre-trained Transformers for Extractive Text Summarization: An Innovative Approach

Ashwini Tangade, Ashish Kumar Verma, Narayana Darapaneni, Y. Harika, Prasanna, Anwesh Reddy Paduri, Srinath Ram Shankar, Ravi Sadalagi
{"title":"The Power of Pre-trained Transformers for Extractive Text Summarization: An Innovative Approach","authors":"Ashwini Tangade, Ashish Kumar Verma, Narayana Darapaneni, Y. Harika, Prasanna, Anwesh Reddy Paduri, Srinath Ram Shankar, Ravi Sadalagi","doi":"10.1109/ESDC56251.2023.10149858","DOIUrl":null,"url":null,"abstract":"In this study, we suggest a unique method for text summarization that combines the TextRank algorithm, Kmeans clustering, and neural network classification. To determine which phrases in a given text are most crucial, the basic model uses TextRank, a graph-based algorithm. In order to group together comparable sentences, these sentences are subsequently clustered using K-means. The best representative statement from each cluster is chosen as the final summary in the last phase of our method using neural network classification. In order to enhance TextRank’s functionality, we also suggest an optimization strategy called cosine similarity with TextRank (Cosim-TextRank). In order to further improve the model’s accuracy, we also suggest using weighted cosine similarity. Overall, our method successfully creates a summary of the text by choosing significant and illustrative phrases while maintaining the context and content of the original text. The experimental findings demonstrate that, in terms of ROUGE scores and human evaluation, our suggested strategy performs better than the current state-of-the-art methods.","PeriodicalId":354855,"journal":{"name":"2023 11th International Symposium on Electronic Systems Devices and Computing (ESDC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 11th International Symposium on Electronic Systems Devices and Computing (ESDC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ESDC56251.2023.10149858","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this study, we suggest a unique method for text summarization that combines the TextRank algorithm, Kmeans clustering, and neural network classification. To determine which phrases in a given text are most crucial, the basic model uses TextRank, a graph-based algorithm. In order to group together comparable sentences, these sentences are subsequently clustered using K-means. The best representative statement from each cluster is chosen as the final summary in the last phase of our method using neural network classification. In order to enhance TextRank’s functionality, we also suggest an optimization strategy called cosine similarity with TextRank (Cosim-TextRank). In order to further improve the model’s accuracy, we also suggest using weighted cosine similarity. Overall, our method successfully creates a summary of the text by choosing significant and illustrative phrases while maintaining the context and content of the original text. The experimental findings demonstrate that, in terms of ROUGE scores and human evaluation, our suggested strategy performs better than the current state-of-the-art methods.
预训练的变形器在提取文本摘要中的作用:一种创新的方法
在这项研究中,我们提出了一种独特的文本摘要方法,该方法结合了TextRank算法、Kmeans聚类和神经网络分类。为了确定给定文本中的哪些短语是最重要的,基本模型使用TextRank,这是一种基于图的算法。为了将可比较的句子组合在一起,这些句子随后使用K-means聚类。在我们使用神经网络分类方法的最后阶段,从每个聚类中选择最具代表性的语句作为最终摘要。为了增强TextRank的功能,我们还提出了一种优化策略,称为与TextRank的余弦相似度(cosimtextrank)。为了进一步提高模型的准确性,我们还建议使用加权余弦相似度。总的来说,我们的方法通过选择重要的和说明性的短语,同时保持原文的上下文和内容,成功地创建了文本的摘要。实验结果表明,就ROUGE分数和人类评价而言,我们建议的策略比当前最先进的方法表现得更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信