Influence Maximization in Temporal Social Networks with a Cold-Start Problem: A Supervised Approach

• URL: http://arxiv.org/abs/2504.11245v1
• Date: Tue, 15 Apr 2025 14:44:30 GMT
• Title: Influence Maximization in Temporal Social Networks with a Cold-Start Problem: A Supervised Approach
• Authors: Laixin Xie, Ying Zhang, Xiyuan Wang, Shiyi Liu, Shenghan Gao, Xingxing Xing, Wei Wan, Haipeng Zhang, Quan Li,
• Abstract summary: Influence Maximization (IM) in temporal graphs focuses on identifying influential "seeds" that are pivotal for maximizing network expansion.<n>We advocate defining these seeds through Influence Propagation Paths (IPPs)<n>Our focus lies in efficiently labeling IPPs and accurately predicting these seeds, while addressing the often-overlooked cold-start issue prevalent in temporal networks.
• Score: 16.047046903057225
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Influence Maximization (IM) in temporal graphs focuses on identifying influential "seeds" that are pivotal for maximizing network expansion. We advocate defining these seeds through Influence Propagation Paths (IPPs), which is essential for scaling up the network. Our focus lies in efficiently labeling IPPs and accurately predicting these seeds, while addressing the often-overlooked cold-start issue prevalent in temporal networks. Our strategy introduces a motif-based labeling method and a tensorized Temporal Graph Network (TGN) tailored for multi-relational temporal graphs, bolstering prediction accuracy and computational efficiency. Moreover, we augment cold-start nodes with new neighbors from historical data sharing similar IPPs. The recommendation system within an online team-based gaming environment presents subtle impact on the social network, forming multi-relational (i.e., weak and strong) temporal graphs for our empirical IM study. We conduct offline experiments to assess prediction accuracy and model training efficiency, complemented by online A/B testing to validate practical network growth and the effectiveness in addressing the cold-start issue.

Related papers

• GNN-Based Candidate Node Predictor for Influence Maximization in Temporal Graphs [3.3853959586196645]
  We propose a learning-based approach integrating Graph Networks with Bidirectional Long Short-Term Memory (BiLSTM) models.<n>BiLSTM allows our model to analyze patterns from both past and future network states, ensuring adaptability to changes over time.<n>Our method is particularly effective in fields like viral marketing and social network analysis, where understanding temporal dynamics is crucial.
  arXiv  Detail & Related papers  (2025-03-31T04:28:37Z)
• Efficient and Privacy-Preserved Link Prediction via Condensed Graphs [49.898152180805454]
  We introduce HyDROtextsuperscript+, a graph condensation method guided by algebraic Jaccard similarity.<n>Our method achieves nearly 20* faster training and reduces storage requirements by 452*, compared to link prediction on the original networks.
  arXiv  Detail & Related papers  (2025-03-15T14:54:04Z)
• Influence Maximization via Graph Neural Bandits [54.45552721334886]
  We set the IM problem in a multi-round diffusion campaign, aiming to maximize the number of distinct users that are influenced. We propose the framework IM-GNB (Influence Maximization with Graph Neural Bandits), where we provide an estimate of the users' probabilities of being influenced.
  arXiv  Detail & Related papers  (2024-06-18T17:54:33Z)
• Temporal Link Prediction Using Graph Embedding Dynamics [0.0]
  Temporal link prediction in dynamic networks is of particular interest due to its potential for solving complex scientific and real-world problems. Traditional approaches to temporal link prediction have focused on finding the aggregation of dynamics of the network as a unified output. We propose a novel perspective on temporal link prediction by defining nodes as Newtonian objects and incorporating the concept of velocity to predict network dynamics.
  arXiv  Detail & Related papers  (2024-01-15T07:35:29Z)
• Temporal Aggregation and Propagation Graph Neural Networks for Dynamic Representation [67.26422477327179]
  Temporal graphs exhibit dynamic interactions between nodes over continuous time. We propose a novel method of temporal graph convolution with the whole neighborhood. Our proposed TAP-GNN outperforms existing temporal graph methods by a large margin in terms of both predictive performance and online inference latency.
  arXiv  Detail & Related papers  (2023-04-15T08:17:18Z)
• Influencer Detection with Dynamic Graph Neural Networks [56.1837101824783]
  We investigate different dynamic Graph Neural Networks (GNNs) configurations for influencer detection. We show that using deep multi-head attention in GNN and encoding temporal attributes significantly improves performance.
  arXiv  Detail & Related papers  (2022-11-15T13:00:25Z)
• Provably Efficient Reinforcement Learning for Online Adaptive Influence Maximization [53.11458949694947]
  We consider an adaptive version of content-dependent online influence problem where seed nodes are sequentially activated based on realtime feedback. Our algorithm maintains a network model estimate and selects seed adaptively, exploring the social network while improving the optimal policy optimistically.
  arXiv  Detail & Related papers  (2022-06-29T18:17:28Z)
• Preference Enhanced Social Influence Modeling for Network-Aware Cascade Prediction [59.221668173521884]
  We propose a novel framework to promote cascade size prediction by enhancing the user preference modeling. Our end-to-end method makes the user activating process of information diffusion more adaptive and accurate.
  arXiv  Detail & Related papers  (2022-04-18T09:25:06Z)
• Temporal-Relational Hypergraph Tri-Attention Networks for Stock Trend Prediction [45.74513775015998]
  We present a collaborative temporal-relational modeling framework for end-to-end stock trend prediction. A novel hypergraph tri-attention network (HGTAN) is proposed to augment the hypergraph convolutional networks. In this manner, HGTAN adaptively determines the importance of nodes, hyperedges, and hypergraphs during the information propagation among stocks.
  arXiv  Detail & Related papers  (2021-07-22T02:16:09Z)
• Predicting Critical Nodes in Temporal Networks by Dynamic Graph Convolutional Networks [1.213512753726579]
  It is difficult to identify critical nodes because the network structure changes over time in temporal networks. This paper proposes a novel and effective learning framework based on the combination of special GCNs and RNNs. Experimental results on four real-world temporal networks demonstrate that the proposed method outperforms both traditional and deep learning benchmark methods.
  arXiv  Detail & Related papers  (2021-06-19T04:16:18Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.