PCTS: Partition Based Clustering for Text Summarization

Subhransu Dash, Tanuj Mohanty, Sri Rijul Das, Ankit Mohanty, Rasmita Rautray
{"title":"PCTS: Partition Based Clustering for Text Summarization","authors":"Subhransu Dash, Tanuj Mohanty, Sri Rijul Das, Ankit Mohanty, Rasmita Rautray","doi":"10.1109/APSIT58554.2023.10201655","DOIUrl":null,"url":null,"abstract":"The exponential growth of digital data has resulted in an unprecedented amount of information being generated on a daily basis. It has become increasingly difficult to keep up with the sheer volume of information, and manual text summarization has become a tedious and time-consuming task. As a result, text summarization has grown in significance as a field of study in natural language processing. This study offers a text summarizing method that identifies a text's key sentences using partition-based clustering and similarity metrics. The sentence similarity score is computed using Euclidian Distance (Euc), Cosine Similarity (Cos), and Jaccard Similarity (Jac). The proposed model uses possible combinations of clustering and similarity algorithms and is validated over the Document Understanding Conferences (DUC) dataset. The proposed model combination of K-Mean clustering with cosine similarity shows significantly better results than the other summarizers. Overall, this paper provides an efficient and effective way to generate text summaries that capture the essential information in a given text.","PeriodicalId":170044,"journal":{"name":"2023 International Conference in Advances in Power, Signal, and Information Technology (APSIT)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 International Conference in Advances in Power, Signal, and Information Technology (APSIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APSIT58554.2023.10201655","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The exponential growth of digital data has resulted in an unprecedented amount of information being generated on a daily basis. It has become increasingly difficult to keep up with the sheer volume of information, and manual text summarization has become a tedious and time-consuming task. As a result, text summarization has grown in significance as a field of study in natural language processing. This study offers a text summarizing method that identifies a text's key sentences using partition-based clustering and similarity metrics. The sentence similarity score is computed using Euclidian Distance (Euc), Cosine Similarity (Cos), and Jaccard Similarity (Jac). The proposed model uses possible combinations of clustering and similarity algorithms and is validated over the Document Understanding Conferences (DUC) dataset. The proposed model combination of K-Mean clustering with cosine similarity shows significantly better results than the other summarizers. Overall, this paper provides an efficient and effective way to generate text summaries that capture the essential information in a given text.
基于分区的文本摘要聚类
数字数据的指数级增长导致每天产生前所未有的信息量。跟上信息量的增长已经变得越来越困难,手动文本摘要已经成为一项乏味而耗时的任务。因此,文本摘要作为自然语言处理的一个研究领域,其重要性与日俱增。本研究提供了一种文本总结方法,该方法使用基于分区的聚类和相似性度量来识别文本的关键句子。句子相似度评分是使用欧几里得距离(Euclidian Distance, Euc)、余弦相似度(Cos)和雅卡德相似度(Jac)来计算的。提出的模型使用了聚类和相似算法的可能组合,并在文档理解会议(DUC)数据集上进行了验证。所提出的k -均值聚类与余弦相似度的模型组合效果明显优于其他摘要器。总的来说,本文提供了一种高效的方法来生成文本摘要,以捕获给定文本中的基本信息。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信