conteNXt:基于图的方法,在 OSN 中吸收内容和上下文以进行事件检测

IF 4.5 2区 计算机科学 Q1 COMPUTER SCIENCE, CYBERNETICS
Sielvie Sharma;Muhammad Abulaish;Tanvir Ahmad
{"title":"conteNXt:基于图的方法,在 OSN 中吸收内容和上下文以进行事件检测","authors":"Sielvie Sharma;Muhammad Abulaish;Tanvir Ahmad","doi":"10.1109/TCSS.2024.3372399","DOIUrl":null,"url":null,"abstract":"Social networks are rapidly expanding due to their imperative role in disseminating information in a split second, emerging as the primary source for breaking news. As a result, the rich, user-generated information entices researchers to delve deeper and extract valuable insights. Event detection in online social networks (OSNs) is a research problem that has shifted researchers attention from traditional news media to online social media data. Event detection in OSNs is an automated process, addressing the impractical task of manually filtering potential events from vast amounts of online data. Unfortunately, the informality and semantic sparsity of online social networking text pose significant challenges to the event detection task. To this end, we present an approach named \n<monospace>conteNXt</monospace>\n for detecting events from Twitter (currently “X”) posts (also known as Tweets). To handle large amounts of data, the proposed method divides tweets into bins and uses postprocessing methods to extract bursty keyphrases. These keyphrases are then used to generate a weighted keyphrase graph using the Word2Vec model. Finally, Markov clustering is employed to cluster and detect events in the bursty keyphrase graph. \n<monospace>conteNXt</monospace>\n is evaluated on the \n<monospace>EventCorpus2012</monospace>\n benchmark dataset and two additional datasets extracted from the archive, \n<monospace>Archive2020</monospace>\n and \n<monospace>Archive2021</monospace>\n, using performance evaluation metrics: #events, precision, recall, and F1-score. The proposed approach outperforms state-of-the-art methods, including \n<monospace>SEDTWik</monospace>\n, \n<monospace>Twevent</monospace>\n, \n<monospace>Sentence-BERT</monospace>\n, \n<monospace>MABED</monospace>\n, \n<monospace>EDED</monospace>\n, \n<monospace>CommunityINDICATOR</monospace>\n, and \n<monospace>EventX</monospace>\n. Additionally, the proposed approach is capable of detecting vital events that are not identified by the aforementioned state-of-the-art methods. \n<uri>https://github.com/Sielvi/conteNXt</uri>","PeriodicalId":13044,"journal":{"name":"IEEE Transactions on Computational Social Systems","volume":null,"pages":null},"PeriodicalIF":4.5000,"publicationDate":"2024-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"conteNXt: A Graph-Based Approach to Assimilate Content and Context for Event Detection in OSN\",\"authors\":\"Sielvie Sharma;Muhammad Abulaish;Tanvir Ahmad\",\"doi\":\"10.1109/TCSS.2024.3372399\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Social networks are rapidly expanding due to their imperative role in disseminating information in a split second, emerging as the primary source for breaking news. As a result, the rich, user-generated information entices researchers to delve deeper and extract valuable insights. Event detection in online social networks (OSNs) is a research problem that has shifted researchers attention from traditional news media to online social media data. Event detection in OSNs is an automated process, addressing the impractical task of manually filtering potential events from vast amounts of online data. Unfortunately, the informality and semantic sparsity of online social networking text pose significant challenges to the event detection task. To this end, we present an approach named \\n<monospace>conteNXt</monospace>\\n for detecting events from Twitter (currently “X”) posts (also known as Tweets). To handle large amounts of data, the proposed method divides tweets into bins and uses postprocessing methods to extract bursty keyphrases. These keyphrases are then used to generate a weighted keyphrase graph using the Word2Vec model. Finally, Markov clustering is employed to cluster and detect events in the bursty keyphrase graph. \\n<monospace>conteNXt</monospace>\\n is evaluated on the \\n<monospace>EventCorpus2012</monospace>\\n benchmark dataset and two additional datasets extracted from the archive, \\n<monospace>Archive2020</monospace>\\n and \\n<monospace>Archive2021</monospace>\\n, using performance evaluation metrics: #events, precision, recall, and F1-score. The proposed approach outperforms state-of-the-art methods, including \\n<monospace>SEDTWik</monospace>\\n, \\n<monospace>Twevent</monospace>\\n, \\n<monospace>Sentence-BERT</monospace>\\n, \\n<monospace>MABED</monospace>\\n, \\n<monospace>EDED</monospace>\\n, \\n<monospace>CommunityINDICATOR</monospace>\\n, and \\n<monospace>EventX</monospace>\\n. Additionally, the proposed approach is capable of detecting vital events that are not identified by the aforementioned state-of-the-art methods. \\n<uri>https://github.com/Sielvi/conteNXt</uri>\",\"PeriodicalId\":13044,\"journal\":{\"name\":\"IEEE Transactions on Computational Social Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":4.5000,\"publicationDate\":\"2024-03-29\",\"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/10485393/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"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/10485393/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, CYBERNETICS","Score":null,"Total":0}
引用次数: 0

摘要

社交网络因其在瞬间传播信息方面的重要作用而迅速扩张,成为突发新闻的主要来源。因此,丰富的用户生成信息吸引着研究人员深入研究并提取有价值的见解。在线社交网络(OSN)中的事件检测是一个研究课题,它将研究人员的注意力从传统新闻媒体转移到了在线社交媒体数据上。OSN 中的事件检测是一个自动化过程,它解决了从海量在线数据中人工筛选潜在事件这一不切实际的任务。遗憾的是,在线社交网络文本的非正式性和语义稀缺性给事件检测任务带来了巨大挑战。为此,我们提出了一种名为 conteNXt 的方法,用于从 Twitter(目前为 "X")帖子(也称为 Tweets)中检测事件。为了处理海量数据,我们提出的方法将推文划分为若干箱,并使用后处理方法来提取突发关键词。然后使用 Word2Vec 模型将这些关键词生成加权关键词图。ConteNXt 在 EventCorpus2012 基准数据集以及从档案中提取的另外两个数据集 Archive2020 和 Archive2021 上使用性能评估指标进行了评估:#事件、精确度、召回率和 F1 分数。所提出的方法优于最先进的方法,包括 SEDTWik、Twevent、Sentence-BERT、MABED、EDED、CommunityINDICATOR 和 EventX。此外,所提出的方法还能检测到上述最先进方法无法识别的重要事件。https://github.com/Sielvi/conteNXt。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
conteNXt: A Graph-Based Approach to Assimilate Content and Context for Event Detection in OSN
Social networks are rapidly expanding due to their imperative role in disseminating information in a split second, emerging as the primary source for breaking news. As a result, the rich, user-generated information entices researchers to delve deeper and extract valuable insights. Event detection in online social networks (OSNs) is a research problem that has shifted researchers attention from traditional news media to online social media data. Event detection in OSNs is an automated process, addressing the impractical task of manually filtering potential events from vast amounts of online data. Unfortunately, the informality and semantic sparsity of online social networking text pose significant challenges to the event detection task. To this end, we present an approach named conteNXt for detecting events from Twitter (currently “X”) posts (also known as Tweets). To handle large amounts of data, the proposed method divides tweets into bins and uses postprocessing methods to extract bursty keyphrases. These keyphrases are then used to generate a weighted keyphrase graph using the Word2Vec model. Finally, Markov clustering is employed to cluster and detect events in the bursty keyphrase graph. conteNXt is evaluated on the EventCorpus2012 benchmark dataset and two additional datasets extracted from the archive, Archive2020 and Archive2021 , using performance evaluation metrics: #events, precision, recall, and F1-score. The proposed approach outperforms state-of-the-art methods, including SEDTWik , Twevent , Sentence-BERT , MABED , EDED , CommunityINDICATOR , and EventX . Additionally, the proposed approach is capable of detecting vital events that are not identified by the aforementioned state-of-the-art methods. https://github.com/Sielvi/conteNXt
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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.
×
引用
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学术官方微信