Learning Representation over Dynamic Graph using Aggregation-Diffusion Mechanism
arXiv:2106.01678
Abstract
Representation learning on graphs that evolve has recently received significant attention due to its wide application scenarios, such as bioinformatics, knowledge graphs, and social networks. The propagation of information in graphs is important in learning dynamic graph representations, and most of the existing methods achieve this by aggregation. However, relying only on aggregation to propagate information in dynamic graphs can result in delays in information propagation and thus affect the performance of the method. To alleviate this problem, we propose an aggregation-diffusion (AD) mechanism that actively propagates information to its neighbor by diffusion after the node updates its embedding through the aggregation mechanism. In experiments on two real-world datasets in the dynamic link prediction task, the AD mechanism outperforms the baseline models that only use aggregation to propagate information. We further conduct extensive experiments to discuss the influence of different factors in the AD mechanism.
References in corpus (11)
- Semi-Supervised Classification with Graph Convolutional Networks
- Fundamentals of Recurrent Neural Network (RNN) and Long Short-Term Memory (LSTM) Network
- Inductive Representation Learning on Large Graphs
- Dynamic Graph Convolutional Networks
- Foundations and modelling of dynamic networks using Dynamic Graph Neural Networks: A survey
- A Compositional Object-Based Approach to Learning Physical Dynamics
- Temporal Graph Networks for Deep Learning on Dynamic Graphs
- Dynamics on networks: competition of temporal and topological correlations
- Recurrent Event Network: Autoregressive Structure Inference over Temporal Knowledge Graphs
- Graph Hawkes Neural Network for Forecasting on Temporal Knowledge Graphs
- MathNet: Haar-Like Wavelet Multiresolution-Analysis for Graph Representation and Learning