mlsanityData to 7 Oct 2026

GNN-Based Candidate Node Predictor for Influence Maximization in Temporal Graphs

arXiv 2503.23713 ↗First posted 31 Mar 2025cs.SI cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

In an age where information spreads rapidly across social media, effectively identifying influential nodes in dynamic networks is critical. Traditional influence maximization strategies often fail to keep up with rapidly evolving relationships and structures, leading to missed opportunities and inefficiencies. To address this, we propose a novel learning-based approach integrating Graph Neural Networks (GNNs) with Bidirectional Long Short-Term Memory (BiLSTM) models. This hybrid framework captures both structural and temporal dynamics, enabling accurate prediction of candidate nodes for seed set selection. The bidirectional nature of BiLSTM allows our model to analyze patterns from both past and future network states, ensuring adaptability to changes over time. By dynamically adapting to graph evolution at each time snapshot, our approach improves seed set calculation efficiency, achieving an average of 90% accuracy in predicting potential seed nodes across diverse networks. This significantly reduces computational overhead by optimizing the number of nodes evaluated for seed selection. Our method is particularly effective in fields like viral marketing and social network analysis, where understanding temporal dynamics is crucial.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 3 of its 19 references that are in the map. First posted on arXiv 31 Mar 2025.

Builds on

3 of 19 references.

References · 3

  1. 2014Sketch-based Influence Maximization and Computation: Scaling up with Guaranteescited by 9
  2. 2014Searching for superspreaders of information in real-world social mediacited by 6
  3. 2022GraMeR: Graph Meta Reinforcement Learning for Multi-Objective Influence Maximizationcited by 2

Built on by

Not cited yet.