MRME-Net:从社交信息中高效检测事件的多语义学习和长尾问题

IF 5.2 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Ruihan Wu , Tianfa Hong , FangYing Wan
{"title":"MRME-Net:从社交信息中高效检测事件的多语义学习和长尾问题","authors":"Ruihan Wu ,&nbsp;Tianfa Hong ,&nbsp;FangYing Wan","doi":"10.1016/j.jksuci.2024.102070","DOIUrl":null,"url":null,"abstract":"<div><p>Discovering trending social events (e.g., major meetings, political scandals, natural disasters, etc.) from social messages is vital because it emphasizes important events and can help people comprehend the world. However, the heterogeneous semantics enrichment, severe long-tail problems, and sparse text contents of social messages pose great challenges to event detection, often leading to limited generalization ability and accuracy. In this paper, we propose a novel Multi-Relational Meta-Enhanced Network (MRME-Net) architecture to learn social events. First, we model social messages into a multi-relational message graph, incorporating abundant meta-semantics along with various meta-relations. Second, we present a multi-relational graph attention network based on Sophia by using a dual-step message aggregation mechanisms to capture the local features of neighboring messages and global semantics of mutiple relations and ultimately learn social message embeddings. We use Sophia optimizer to reduce the massive time and cost of training. Third, in order to address the long-tail problem, we introduce a locally-adapted meta-learning framework in social event detection for the first time and propose a novel META-TAILENH embedding enhancement strategy to refine tail node embeddings in multi-relational graph. Eventually, we conduct the detection of social events according to the hierarchical clustering algorithm. Extensive experiments have been carried out to evaluate MRME-Net on the MAVEN and Twitter dataset, revealing a notable improvement of 3 %–13 %, 4 %–20 % and 6 %–30 % increases on NMI, AMI and ARI in the social event detection task.</p></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":null,"pages":null},"PeriodicalIF":5.2000,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1319157824001599/pdfft?md5=16a8646203ecb19a3bedc076ec6e6c1e&pid=1-s2.0-S1319157824001599-main.pdf","citationCount":"0","resultStr":"{\"title\":\"MRME-Net: Towards multi-semantics learning and long-tail problem of efficient event detection from social messages\",\"authors\":\"Ruihan Wu ,&nbsp;Tianfa Hong ,&nbsp;FangYing Wan\",\"doi\":\"10.1016/j.jksuci.2024.102070\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Discovering trending social events (e.g., major meetings, political scandals, natural disasters, etc.) from social messages is vital because it emphasizes important events and can help people comprehend the world. However, the heterogeneous semantics enrichment, severe long-tail problems, and sparse text contents of social messages pose great challenges to event detection, often leading to limited generalization ability and accuracy. In this paper, we propose a novel Multi-Relational Meta-Enhanced Network (MRME-Net) architecture to learn social events. First, we model social messages into a multi-relational message graph, incorporating abundant meta-semantics along with various meta-relations. Second, we present a multi-relational graph attention network based on Sophia by using a dual-step message aggregation mechanisms to capture the local features of neighboring messages and global semantics of mutiple relations and ultimately learn social message embeddings. We use Sophia optimizer to reduce the massive time and cost of training. Third, in order to address the long-tail problem, we introduce a locally-adapted meta-learning framework in social event detection for the first time and propose a novel META-TAILENH embedding enhancement strategy to refine tail node embeddings in multi-relational graph. Eventually, we conduct the detection of social events according to the hierarchical clustering algorithm. Extensive experiments have been carried out to evaluate MRME-Net on the MAVEN and Twitter dataset, revealing a notable improvement of 3 %–13 %, 4 %–20 % and 6 %–30 % increases on NMI, AMI and ARI in the social event detection task.</p></div>\",\"PeriodicalId\":48547,\"journal\":{\"name\":\"Journal of King Saud University-Computer and Information Sciences\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":5.2000,\"publicationDate\":\"2024-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S1319157824001599/pdfft?md5=16a8646203ecb19a3bedc076ec6e6c1e&pid=1-s2.0-S1319157824001599-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of King Saud University-Computer and Information Sciences\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1319157824001599\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of King Saud University-Computer and Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1319157824001599","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

从社交信息中发现趋势性社交事件(如重大会议、政治丑闻、自然灾害等)至关重要,因为它可以强调重要事件,帮助人们理解世界。然而,社交信息的异构语义丰富性、严重的长尾问题和稀疏的文本内容给事件检测带来了巨大挑战,往往导致泛化能力和准确性有限。在本文中,我们提出了一种新颖的多关系元增强网络(MRME-Net)架构来学习社交事件。首先,我们将社交信息建模为多关系信息图,将丰富的元语义与各种元关系结合起来。其次,我们提出了基于 Sophia 的多关系图关注网络,通过使用双步骤消息聚合机制来捕捉相邻消息的局部特征和多重关系的全局语义,并最终学习社交消息嵌入。我们使用 Sophia 优化器来减少大量的训练时间和成本。第三,针对长尾问题,我们首次在社会事件检测中引入了局部适应的元学习框架,并提出了新颖的 META-TAILENH 嵌入增强策略,以完善多关系图中的尾节点嵌入。最后,我们根据分层聚类算法对社会事件进行检测。在MAVEN和Twitter数据集上对MRME-Net进行了广泛的实验评估,结果显示,在社会事件检测任务中,MRME-Net比NMI、AMI和ARI分别提高了3%-13%、4%-20%和6%-30%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
MRME-Net: Towards multi-semantics learning and long-tail problem of efficient event detection from social messages

Discovering trending social events (e.g., major meetings, political scandals, natural disasters, etc.) from social messages is vital because it emphasizes important events and can help people comprehend the world. However, the heterogeneous semantics enrichment, severe long-tail problems, and sparse text contents of social messages pose great challenges to event detection, often leading to limited generalization ability and accuracy. In this paper, we propose a novel Multi-Relational Meta-Enhanced Network (MRME-Net) architecture to learn social events. First, we model social messages into a multi-relational message graph, incorporating abundant meta-semantics along with various meta-relations. Second, we present a multi-relational graph attention network based on Sophia by using a dual-step message aggregation mechanisms to capture the local features of neighboring messages and global semantics of mutiple relations and ultimately learn social message embeddings. We use Sophia optimizer to reduce the massive time and cost of training. Third, in order to address the long-tail problem, we introduce a locally-adapted meta-learning framework in social event detection for the first time and propose a novel META-TAILENH embedding enhancement strategy to refine tail node embeddings in multi-relational graph. Eventually, we conduct the detection of social events according to the hierarchical clustering algorithm. Extensive experiments have been carried out to evaluate MRME-Net on the MAVEN and Twitter dataset, revealing a notable improvement of 3 %–13 %, 4 %–20 % and 6 %–30 % increases on NMI, AMI and ARI in the social event detection task.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
10.50
自引率
8.70%
发文量
656
审稿时长
29 days
期刊介绍: In 2022 the Journal of King Saud University - Computer and Information Sciences will become an author paid open access journal. Authors who submit their manuscript after October 31st 2021 will be asked to pay an Article Processing Charge (APC) after acceptance of their paper to make their work immediately, permanently, and freely accessible to all. The Journal of King Saud University Computer and Information Sciences is a refereed, international journal that covers all aspects of both foundations of computer and its practical 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学术官方微信