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

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.

Authors

Institutions

Publication Details

Journal
Proceedings of the International AAAI Conference on Web and Social Media
Published
2025-06-07
DOI
https://doi.org/10.1609/icwsm.v19i1.35919
Citations
1
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
1.32

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Xingxing Xing, Laixin Xie, Shiyi Liu, Ying Zhang et al.
1 citations
Proceedings of the International AAAI Conference on Web and Social Media
Complex Network Analysis Techniques
1.32
article

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

Xingxing Xing, Laixin Xie, Shiyi Liu, Ying Zhang, Quan Li, Haipeng Zhang, Wei Wan, Xiyuan Wang, Shenghan Gao
article en
1 citations

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.

Proceedings of the International AAAI Conference on Web and Social MediaVol. 19
ShanghaiTech University (CN), NetEase (China) (CN), Arizona State University (US)
National Natural Science Foundation of China
Openalex Percentile: Top 19%
Complex Network Analysis Techniques
1.32
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.