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.