{"title":"MRME-Net: Towards multi-semantics learning and long-tail problem of efficient event detection from social messages","authors":"Ruihan Wu , Tianfa Hong , 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}
引用次数: 0
Abstract
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.
期刊介绍:
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.