A probabilistic approach for extractive summarization based on clustering cum graph ranking method

自动汇总 计算机科学 聚类分析 概率逻辑 图形 排名(信息检索) 数据挖掘 聚类系数 情报检索 人工智能 理论计算机科学
作者
Amreen Ahmad,Tanvir Ahmad,Sarfaraz Masood,Mohd Khizir Siddiqui,Basma Abd El-Rahiem,Paweł Pławiak,Fahad Alblehai
出处
期刊:IEEE Access [Institute of Electrical and Electronics Engineers]
卷期号:: 1-1
标识
DOI:10.1109/access.2024.3392252
摘要

Online information has increased tremendously in today's age of the Internet.As a result, the need has arisen to extract relevant content from the plethora of available information.Researchers are widely using automatic text summarization techniques for extracting useful and relevant information from voluminous available information.The summary obtained from the automatic text summarization often faces the issues of diversity and information coverage.Earlier researchers have used graph-based approaches for ranking and optimization.This research work introduces a probabilistic approach named as ClusRank for summary extraction, comprising of a two-stage sentence selection model involving clustering and then ranking of sentences.The initial stage involves clustering of sentences using a proposed overlapping clustering algorithm on the weighted network, and later selection of salient sentences using the introduced probabilistic approach.In the analysis of real-world networks, community structure development is essential because it provides strategic insights that help decision-makers make well-informed choices.Furthermore, methodologically strict community detection algorithms are required due to the occurrence of discontinuous, overlapping, and nested community patterns in such networks.This research work, an algorithm is presented for detecting overlapping communities based on the concept of rough set and granular information on links.The sentence selection algorithm based on budget maximum coverage approach supports the assumption that larger sub-topics in a document are of more importance than smaller subtopics.The performance of the proposed probabilistic ClusRank is validated on DUC2001, DUC 2002, DUC2004, and DUC 2006 data sets.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
尊敬仙人掌完成签到,获得积分10
1秒前
年糕.发布了新的文献求助10
1秒前
guojin发布了新的文献求助10
1秒前
霸气乘风完成签到,获得积分10
1秒前
脑瓜子嗡嗡滴完成签到,获得积分10
1秒前
qiyr完成签到,获得积分10
2秒前
沐秋完成签到,获得积分10
3秒前
yoyo发布了新的文献求助10
3秒前
3秒前
汉堡包应助积极的妖丽采纳,获得10
3秒前
3秒前
3秒前
LMBE1K完成签到 ,获得积分10
4秒前
4秒前
眼睛大的冰安完成签到,获得积分10
4秒前
酒酒发布了新的文献求助30
5秒前
Ming发布了新的文献求助10
5秒前
xl关闭了xl文献求助
5秒前
量子星尘发布了新的文献求助50
6秒前
虚幻故事完成签到,获得积分10
6秒前
许峰完成签到,获得积分10
6秒前
SSS完成签到,获得积分20
7秒前
小妍发布了新的文献求助10
7秒前
8秒前
8秒前
9秒前
年糕.完成签到,获得积分10
9秒前
9秒前
CodeCraft应助北还北采纳,获得10
10秒前
Akim应助朴实思春采纳,获得10
11秒前
金鱼君完成签到,获得积分10
12秒前
paper reader完成签到,获得积分10
12秒前
大个应助脑瓜子嗡嗡滴采纳,获得10
12秒前
周肆发布了新的文献求助10
12秒前
SciGPT应助香蕉如曼采纳,获得10
13秒前
14秒前
武大西门发布了新的文献求助10
14秒前
桐桐应助naomi采纳,获得30
14秒前
熊猫文文发布了新的文献求助10
15秒前
Milktea123完成签到,获得积分10
15秒前
高分求助中
Picture Books with Same-sex Parented Families: Unintentional Censorship 700
ACSM’s Guidelines for Exercise Testing and Prescription, 12th edition 500
Nucleophilic substitution in azasydnone-modified dinitroanisoles 500
不知道标题是什么 500
Indomethacinのヒトにおける経皮吸収 400
Phylogenetic study of the order Polydesmida (Myriapoda: Diplopoda) 370
Effective Learning and Mental Wellbeing 300
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 3974426
求助须知:如何正确求助?哪些是违规求助? 3518788
关于积分的说明 11195842
捐赠科研通 3254946
什么是DOI,文献DOI怎么找? 1797649
邀请新用户注册赠送积分活动 877037
科研通“疑难数据库(出版商)”最低求助积分说明 806130