Introduction
Social media platforms generate a continuous stream of information, where identifying "events"—clusters of messages related to specific real-world occurrences—is vital for crisis management and recommendation systems. However, traditional event detection methods struggle with three primary challenges: the "moving target" problem where new event types emerge constantly, the structural complexity of social messages (involving users, hashtags, and entities), and the "memory gap" caused by catastrophic forgetting in incremental learning settings.
To address these issues, this paper introduces KPGNN (Knowledge-Preserving Incremental Heterogeneous Graph Neural Network), a framework designed to detect social events in real-time streams while maintaining learned knowledge over time.
Methodology: The KPGNN Framework
KPGNN leverages Heterogeneous Graph Neural Networks to preserve the rich context of social media interactions. The architecture is divided into several key components that transform raw messages into actionable event clusters.
Heterogeneous Social Message Modeling
Rather than treating messages as isolated text, KPGNN constructs a Heterogeneous Information Network (HIN). This network links messages to their constituent words, named entities, and associated users. This HIN is subsequently mapped into a homogeneous message graph where edges represent shared social elements, ensuring that the underlying context is preserved during the embedding process.
Contrastive Learning for Dynamic Classes
Because the number of social events is unknown and constantly changing, KPGNN avoids standard cross-entropy loss. Instead, it employs a dual-loss strategy:
- Triplet Loss: Pushes messages from the same event closer in the embedding space while separating those from different events.
- Global-Local Pair Loss: Maximizes mutual information between individual message embeddings and the overall graph structure, allowing the model to distinguish events based on their unique social footprints.
Incremental Learning and Maintenance
KPGNN is designed for an inductive life-cycle, allowing it to handle streaming data without requiring full retraining from scratch. This process is managed through three distinct stages: Pre-training, Detection, and Maintenance.
In the Maintenance stage, the model periodically resumes training with new data blocks to update its internal knowledge. To prevent the graph from growing indefinitely, the researchers implemented a pruning strategy. Interestingly, keeping only the latest message block for graph reconstruction yielded the best performance, suggesting that immediate temporal context is more critical for social media learning than maintaining a long, stale history.
Experimental Evaluation
The model was evaluated on two large-scale benchmarks: a Twitter dataset (68,841 tweets, 503 events) and MAVEN (a Wikipedia-based event dataset). KPGNN significantly outperformed baselines such as BERT and specialized models like EventX and PP-GCN.
- Accuracy: In incremental settings, KPGNN achieved a 16% gain in Normalized Mutual Information (NMI) and a 319% gain in Adjusted Mutual Information (AMI) over the EventX baseline.
- Efficiency: By utilizing the "latest message" maintenance strategy, the model maintained high performance while significantly reducing GPU memory usage and training time compared to "keep-all" history strategies.
Conclusion
KPGNN represents a significant advancement in streaming social event detection by combining the inductive power of GNNs with contrastive learning and intelligent graph maintenance. While the model excels at detection, future work may explore causal discovery between events and tracking how social clusters evolve and morph over time.
Summary updated