What have you read? based Multi-Document Summarization

Sabina Irum, Jamal Abdul Nasir, Zakia Jalil
{"title":"What have you read? based Multi-Document Summarization","authors":"Sabina Irum, Jamal Abdul Nasir, Zakia Jalil","doi":"10.33411/ijist/2022040508","DOIUrl":null,"url":null,"abstract":"Due to the tremendous amount of data available today, extracting essential information from such a large volume of data is quite tough. Particularly in the case of text documents, which need a significant amount of time from the user to read the material and extract useful information. The major problem is identifying the user's relevant documents, removing the most significant pieces of information, determining document relevancy, excluding extraneous information, reducing details, and generating a compact, consistent report. For all these issues, we proposed a novel technique that solves the problem of extracting important information from a huge amount of text data and using previously read documents to generate summaries of new documents. Our technique is more focused on extracting topics (also known as topic signatures) from the previously read documents and then selecting the sentences that are more relevant to these topics based on update summary generation. Besides this, the concept of overlapping value is used that digs out the meaningful words and word similarities. Another thing that makes our work better is the Dice Coefficient which measures the intersection of words between document sets and helps to eliminate redundancy. The summary generated is based on more diverse and highly representative sentences with an average length. Empirically, we have observed that our proposed novel technique performed better with baseline competitors on the real-world TAC2008 dataset.","PeriodicalId":298526,"journal":{"name":"Vol 4 Issue 5","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Vol 4 Issue 5","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33411/ijist/2022040508","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Due to the tremendous amount of data available today, extracting essential information from such a large volume of data is quite tough. Particularly in the case of text documents, which need a significant amount of time from the user to read the material and extract useful information. The major problem is identifying the user's relevant documents, removing the most significant pieces of information, determining document relevancy, excluding extraneous information, reducing details, and generating a compact, consistent report. For all these issues, we proposed a novel technique that solves the problem of extracting important information from a huge amount of text data and using previously read documents to generate summaries of new documents. Our technique is more focused on extracting topics (also known as topic signatures) from the previously read documents and then selecting the sentences that are more relevant to these topics based on update summary generation. Besides this, the concept of overlapping value is used that digs out the meaningful words and word similarities. Another thing that makes our work better is the Dice Coefficient which measures the intersection of words between document sets and helps to eliminate redundancy. The summary generated is based on more diverse and highly representative sentences with an average length. Empirically, we have observed that our proposed novel technique performed better with baseline competitors on the real-world TAC2008 dataset.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
你读过什么书?基于多文档摘要
由于目前可用的数据量巨大,从如此大量的数据中提取重要信息是相当困难的。特别是在文本文档的情况下,这需要用户花费大量的时间来阅读材料并提取有用的信息。主要的问题是识别用户的相关文档,删除最重要的信息,确定文档相关性,排除无关信息,减少细节,并生成紧凑、一致的报告。针对这些问题,我们提出了一种新的技术,该技术解决了从大量文本数据中提取重要信息并使用以前读取的文档生成新文档摘要的问题。我们的技术更侧重于从先前阅读的文档中提取主题(也称为主题签名),然后根据更新摘要生成选择与这些主题更相关的句子。在此基础上,利用重叠值的概念,挖掘出有意义的词和词的相似度。另一个让我们的工作变得更好的东西是Dice Coefficient,它测量文档集之间单词的交集,并帮助消除冗余。生成的摘要是基于更多样化和具有高度代表性的平均长度的句子。根据经验,我们已经观察到我们提出的新技术在真实世界的TAC2008数据集上对基线竞争对手表现更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Reliability Awareness Multiple Path Installation in Software Defined Networking using Machine Learning Algorithm Sun Tracking and Control Design for PV Solar energy system Review on Performance Analysis of Three Control Techniques for Buck Converter feeding a Resistive Load Double Auction used Artificial Neural Network in Cloud Computing Critical Review of Blockchain Consensus Algorithms: challenges and opportunities
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1