Adaptive Data Augmentation on Temporal Graphs

Temporal Graph Networks (TGNs) are powerful on modeling temporal graph data based on their increased complexity. Higher complexity carries with it a higher risk of overfitting, which makes TGNs capture random noise instead of essential semantic information. To address this issue, our idea is to transform the temporal graphs using data augmentation (DA) with adaptive magnitudes, so as to effectively augment the input features and preserve the essential semantic information. Based on this idea, we present the MeTA (Memory Tower Augmentation) module: a multi-level module that processes the augmented graphs of different magnitudes on separate levels, and performs message passing across levels to provide adaptively augmented inputs for every prediction. MeTA can be flexibly applied to the training of popular TGNs to improve their effectiveness without increasing their time complexity. To complement MeTA, we propose three DA strategies to realistically model noise by modifying both the temporal and topological features. Empirical results on standard datasets show that MeTA yields significant gains for the popular TGN models on edge prediction and node classification in an efficient manner.

Authors

• Yiwei Wang National University of Singapore, Singapore
• Yujun Cai
• Yuxuan Liang The Hong Kong University of Science and Technology Chinese Academy of Sciences
• Henghui Ding Fudan University
• Changhu Wang University of California, Los Angeles
• Siddharth Bhatia
• Bryan Hooi School of Computing, National University of Singapore

Keywords

No keywords are indexed for this paper.