English

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

Social and Information Networks 2025-04-16 v1 Artificial Intelligence

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.

Keywords

Cite

@article{arxiv.2504.11245,
  title  = {Influence Maximization in Temporal Social Networks with a Cold-Start Problem: A Supervised Approach},
  author = {Laixin Xie and Ying Zhang and Xiyuan Wang and Shiyi Liu and Shenghan Gao and Xingxing Xing and Wei Wan and Haipeng Zhang and Quan Li},
  journal= {arXiv preprint arXiv:2504.11245},
  year   = {2025}
}

Comments

Accepted by ICWSM 2025

R2 v1 2026-06-28T22:59:12.275Z