Xiuqin Liang , Jiazhen Chen , Sichao Fu , Wuli Wang , Mingbin Feng , Tony S. Wirjanto , Qinmu Peng , Baodi Liu , Weihua Ou
{"title":"Multiplex graph prompt collaboration for open-set social event detection","authors":"Xiuqin Liang , Jiazhen Chen , Sichao Fu , Wuli Wang , Mingbin Feng , Tony S. Wirjanto , Qinmu Peng , Baodi Liu , Weihua Ou","doi":"10.1016/j.eswa.2025.128887","DOIUrl":null,"url":null,"abstract":"<div><div>Social event detection (SED) aims to detect event types from social media messages that reflect group behavior and public concerns. Owing to the dynamic evolution nature of social media, newly occurred messages may belong to unseen event types. Recently emerged open-set SED methods introduce graph neural networks (GNN) for feature encoding and iteratively retrain model parameters via the learned pseudo-labels to adapt to new, unknown events. However, retraining the entire model with these noisy pseudo-labels inevitably causes overfitting and risk erasing information learned from known events. In this paper, we propose a novel framework to tackle the open-set SED problem by leveraging the advantages of graph prompt learning (GPL) in its fast adaptation to new data with minimal parameter modifications, termed <strong>M</strong>ultiplex <strong>G</strong>raph <strong>P</strong>rompt <strong>C</strong>ollaboration (MGPC for short). Specifically, MGPC introduces three types of graph prompts to adapt a pre-trained GNN model from old to new message graphs quickly without extensive retraining. To address the distribution shifts issue in node content, graph structures, and temporal context as new data emerges, we introduce a graph adaptation prompt and a temporal prompt, which manage information flow from old to new graphs under evolving temporal context. We further introduce a prototypical-based supervised training loss with a lightweight event embedding prompt, which facilitates quick adaptation to new event class distributions while retaining previously learned information with minimal parameter changes. These adopted prompts are fine-tuned using pseudo-labels generated according to the entropy-based uncertainty scores concerning the known classes, supplemented by an unsupervised contrastive learning component to improve inter-class discrimination for unknown events. Extensive experiments on real-world benchmarks demonstrate the effectiveness of the proposed MGPC framework in comparison to existing SED methods.</div></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":"295 ","pages":"Article 128887"},"PeriodicalIF":7.5000,"publicationDate":"2025-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Expert Systems with Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0957417425025047","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Social event detection (SED) aims to detect event types from social media messages that reflect group behavior and public concerns. Owing to the dynamic evolution nature of social media, newly occurred messages may belong to unseen event types. Recently emerged open-set SED methods introduce graph neural networks (GNN) for feature encoding and iteratively retrain model parameters via the learned pseudo-labels to adapt to new, unknown events. However, retraining the entire model with these noisy pseudo-labels inevitably causes overfitting and risk erasing information learned from known events. In this paper, we propose a novel framework to tackle the open-set SED problem by leveraging the advantages of graph prompt learning (GPL) in its fast adaptation to new data with minimal parameter modifications, termed Multiplex Graph Prompt Collaboration (MGPC for short). Specifically, MGPC introduces three types of graph prompts to adapt a pre-trained GNN model from old to new message graphs quickly without extensive retraining. To address the distribution shifts issue in node content, graph structures, and temporal context as new data emerges, we introduce a graph adaptation prompt and a temporal prompt, which manage information flow from old to new graphs under evolving temporal context. We further introduce a prototypical-based supervised training loss with a lightweight event embedding prompt, which facilitates quick adaptation to new event class distributions while retaining previously learned information with minimal parameter changes. These adopted prompts are fine-tuned using pseudo-labels generated according to the entropy-based uncertainty scores concerning the known classes, supplemented by an unsupervised contrastive learning component to improve inter-class discrimination for unknown events. Extensive experiments on real-world benchmarks demonstrate the effectiveness of the proposed MGPC framework in comparison to existing SED methods.
期刊介绍:
Expert Systems With Applications is an international journal dedicated to the exchange of information on expert and intelligent systems used globally in industry, government, and universities. The journal emphasizes original papers covering the design, development, testing, implementation, and management of these systems, offering practical guidelines. It spans various sectors such as finance, engineering, marketing, law, project management, information management, medicine, and more. The journal also welcomes papers on multi-agent systems, knowledge management, neural networks, knowledge discovery, data mining, and other related areas, excluding applications to military/defense systems.