Shuang Gu;Juntao Tu;Wengang Zhou;Qiming Fu;Ming Sun;Yajin Ge
{"title":"基于分层挖掘的故事线生成方法","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":"{\"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}","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}
A Hierarchical Mining-Based Approach to Storyline Generation
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.
期刊介绍:
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.