A Data-Driven Graph Generative Model for Temporal Interaction Networks

被引:67
作者
Zhou, Dawei [1 ]
Zheng, Lecheng [1 ]
Han, Jiawei [1 ]
He, Jingrui [1 ]
机构
[1] Univ Illinois, Urbana, IL 61801 USA
来源
KDD '20: PROCEEDINGS OF THE 26TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING | 2020年
基金
美国国家科学基金会;
关键词
Graph Generative Model; Temporal Networks; Transformer Model;
D O I
10.1145/3394486.3403082
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Deep graph generative models have recently received a surge of attention due to its superiority of modeling realistic graphs in a variety of domains, including biology, chemistry, and social science. Despite the initial success, most, if not all, of the existing works are designed for static networks. Nonetheless, many realistic networks are intrinsically dynamic and presented as a collection of system logs (i.e., timestamped interactions/edges between entities), which pose a new research direction for us: how can we synthesize realistic dynamic networks by directly learning from the system logs? In addition, how can we ensure the generated graphs preserve both the structural and temporal characteristics of the real data? To address these challenges, we propose an end-to-end deep generative framework named TagGen. In particular, we start with a novel sampling strategy for jointly extracting structural and temporal context information from temporal networks. On top of that, TagGen parameterizes a bi-level self-attention mechanism together with a family of local operations to generate temporal random walks. At last, a discriminator gradually selects generated temporal random walks, that are plausible in the input data, and feeds them to an assembling module for generating temporal networks. The experimental results in seven real-world data sets across a variety of metrics demonstrate that (1) TagGen outperforms all baselines in the temporal interaction network generation problem, and (2) TagGen significantly boosts the performance of the prediction models in the tasks of anomaly detection and link prediction.
引用
收藏
页码:401 / 411
页数:11
相关论文
共 45 条
[1]  
Abney S, 2002, 40TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, PROCEEDINGS OF THE CONFERENCE, P360
[2]  
Akoglu Leman, 2009, DATA MIN KNOWL DISC
[3]   Statistical mechanics of complex networks [J].
Albert, R ;
Barabási, AL .
REVIEWS OF MODERN PHYSICS, 2002, 74 (01) :47-97
[4]   No Place to Hide: Catching Fraudulent Entities in Tensors [J].
Ban, Yikun ;
Liu, Xin ;
Duan, Yitao ;
Liu, Xue ;
Xu, Wei .
WEB CONFERENCE 2019: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2019), 2019, :83-93
[5]  
Bojchevski A, 2018, PR MACH LEARN RES, V80
[6]   Large-Scale Machine Learning with Stochastic Gradient Descent [J].
Bottou, Leon .
COMPSTAT'2010: 19TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL STATISTICS, 2010, :177-186
[7]   TEMPORAL INFORMATION TRANSFORMED INTO A SPATIAL CODE BY A NEURAL-NETWORK WITH REALISTIC PROPERTIES [J].
BUONOMANO, DV ;
MERZENICH, MM .
SCIENCE, 1995, 267 (5200) :1028-1030
[8]  
Chakrabarti D, 2004, SIAM PROC S, P442
[9]  
Erdos P.L., 1959, On Random Graphs. I. Publicationes Mathematicae Debrecen.
[10]   Dynamic graph generation for the shortest path problem in time expanded networks [J].
Fischer, Frank ;
Helmberg, Christoph .
MATHEMATICAL PROGRAMMING, 2014, 143 (1-2) :257-297