A Hierarchical Mining-Based Approach to Storyline Generation

IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, CYBERNETICS IEEE Transactions on Computational Social Systems Pub Date : 2026-10-01 Epub Date: 2026-06-05 DOI:10.1109/TCSS.2025.3648400
Shuang Gu;Juntao Tu;Wengang Zhou;Qiming Fu;Ming Sun;Yajin Ge
{"title":"A Hierarchical Mining-Based Approach to Storyline Generation","authors":"Shuang Gu;Juntao Tu;Wengang Zhou;Qiming Fu;Ming Sun;Yajin Ge","doi":"10.1109/TCSS.2025.3648400","DOIUrl":null,"url":null,"abstract":"Events serve as the fundamental units of human society. With the rapid proliferation of information networks and social media, the dissemination of event-related information has become more pervasive. However, this has also introduced challenges such as information fragmentation, redundancy, and noise, which hinder timely and comprehensive understanding of complex events. Recent research has focused on constructing coherent event narratives by organizing discrete pieces of event information into structured and logically connected developmental chains—a process commonly referred to as storyline generation. Despite notable progress, most existing approaches rely on single-dimensional associations between events and often require extensive multifaceted knowledge, limiting their scalability and effectiveness in handling complex, multifaceted event scenarios. To address this issue, we propose a hierarchical mining-based approach to storyline generation (HMSG). HMSG comprises three core modules. The data preprocessing algorithm is designed to extract and represent textual event features. The coarse-grained clustering algorithm identifies events in the form of story clusters, where events within the same story cluster belong to the same storyline. The fine-grained clustering algorithm divides each story cluster into smaller and semantically cohesive event clusters by capturing stronger local correlations among events. Subsequently, story clusters and event clusters are analyzed to construct the storyline structure, where the main narrative is represented as a trunk and subnarratives as branches. This process culminates in a tree-like representation that effectively illustrates the storyline. To validate the effectiveness of the proposed approach, we conduct extensive experiments on multiple real-world datasets from different domains. Comparative analysis against several state-of-the-art methods for storyline generation demonstrates that HMSG consistently achieves superior performance and robustness across diverse scenarios. The results further confirm that HMSG outperforms baseline approaches in both performance and robustness.","PeriodicalId":13044,"journal":{"name":"IEEE Transactions on Computational Social Systems","volume":"13 5","pages":"6241-6257"},"PeriodicalIF":4.6000,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Computational Social Systems","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11552415/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/6/5 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, CYBERNETICS","Score":null,"Total":0}
引用次数: 0

Abstract

Events serve as the fundamental units of human society. With the rapid proliferation of information networks and social media, the dissemination of event-related information has become more pervasive. However, this has also introduced challenges such as information fragmentation, redundancy, and noise, which hinder timely and comprehensive understanding of complex events. Recent research has focused on constructing coherent event narratives by organizing discrete pieces of event information into structured and logically connected developmental chains—a process commonly referred to as storyline generation. Despite notable progress, most existing approaches rely on single-dimensional associations between events and often require extensive multifaceted knowledge, limiting their scalability and effectiveness in handling complex, multifaceted event scenarios. To address this issue, we propose a hierarchical mining-based approach to storyline generation (HMSG). HMSG comprises three core modules. The data preprocessing algorithm is designed to extract and represent textual event features. The coarse-grained clustering algorithm identifies events in the form of story clusters, where events within the same story cluster belong to the same storyline. The fine-grained clustering algorithm divides each story cluster into smaller and semantically cohesive event clusters by capturing stronger local correlations among events. Subsequently, story clusters and event clusters are analyzed to construct the storyline structure, where the main narrative is represented as a trunk and subnarratives as branches. This process culminates in a tree-like representation that effectively illustrates the storyline. To validate the effectiveness of the proposed approach, we conduct extensive experiments on multiple real-world datasets from different domains. Comparative analysis against several state-of-the-art methods for storyline generation demonstrates that HMSG consistently achieves superior performance and robustness across diverse scenarios. The results further confirm that HMSG outperforms baseline approaches in both performance and robustness.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于分层挖掘的故事线生成方法
事件是人类社会的基本单位。随着信息网络和社交媒体的迅速普及,事件相关信息的传播变得更加普遍。然而,这也带来了诸如信息碎片、冗余和噪声等挑战,阻碍了对复杂事件的及时和全面理解。最近的研究集中于通过将离散的事件信息组织成结构化的、逻辑上相连的发展链来构建连贯的事件叙事——这一过程通常被称为故事情节生成。尽管取得了显著进展,但大多数现有方法依赖于事件之间的单维关联,并且通常需要广泛的多方面知识,这限制了它们在处理复杂的多方面事件场景时的可伸缩性和有效性。为了解决这个问题,我们提出了一种基于分层挖掘的故事线生成方法(HMSG)。HMSG包括三个核心模块。数据预处理算法旨在提取和表示文本事件特征。粗粒度聚类算法以故事簇的形式识别事件,其中同一故事簇中的事件属于相同的故事情节。细粒度聚类算法通过捕获事件之间更强的局部相关性,将每个故事聚类划分为更小的、语义上有凝聚力的事件聚类。随后,通过分析故事集群和事件集群来构建故事情节结构,其中主叙事为主干,次叙事为分支。这个过程最终以树状的表示形式结束,有效地说明了故事情节。为了验证所提出方法的有效性,我们在来自不同领域的多个真实数据集上进行了广泛的实验。与几种最先进的故事情节生成方法的比较分析表明,HMSG在不同场景下始终具有卓越的性能和鲁棒性。结果进一步证实,HMSG在性能和鲁棒性方面都优于基线方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Computational Social Systems
IEEE Transactions on Computational Social Systems Social Sciences-Social Sciences (miscellaneous)
CiteScore
10.00
自引率
20.00%
发文量
316
期刊介绍: IEEE Transactions on Computational Social Systems focuses on such topics as modeling, simulation, analysis and understanding of social systems from the quantitative and/or computational perspective. "Systems" include man-man, man-machine and machine-machine organizations and adversarial situations as well as social media structures and their dynamics. More specifically, the proposed transactions publishes articles on modeling the dynamics of social systems, methodologies for incorporating and representing socio-cultural and behavioral aspects in computational modeling, analysis of social system behavior and structure, and paradigms for social systems modeling and simulation. The journal also features articles on social network dynamics, social intelligence and cognition, social systems design and architectures, socio-cultural modeling and representation, and computational behavior modeling, and their applications.
期刊最新文献
Table of Contents IEEE Transactions on Computational Social Systems Information for Authors Supplier Qualification of the Production Chain in Collaborative Manufacturing via Higher Order Group Multi-Role Assignment A Hierarchical Mining-Based Approach to Storyline Generation Meta-Adaptive Continual Learning for Dynamic Social Communication Graphs
wanfang
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1