Journal
ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA
Volume 17, Issue 3, Pages -Publisher
ASSOC COMPUTING MACHINERY
DOI: 10.1145/3551892
Keywords
Dynamic network; transfer learning; temporal link prediction; self-attention
Funding
- National Natural Science Foundation of China [91746209, 61772102, 62176036]
- Science Foundation Ireland [SFI/12/RC/2289_P2]
- Liaoning Collaborative Fund [2020-HYLH-17]
Ask authors/readers for more resources
This article proposes a transfer learning model called DNformer for predicting temporal link sequences in dynamic networks. By sequencing the structural dynamic evolution into consecutive links, capturing serial correlation using self-attention, and utilizing structural encoding to perceive the importance and correlation of links, the DNformer model outperforms other state-of-the-art TLP methods in various dynamic network problems.
Temporal link prediction (TLP) is among the most important graph learning tasks, capable of predicting dynamic, time-varying links within networks. The key problem of TLP is how to explore potential link-evolving tendency from the increasing number of links over time. There exist three major challenges toward solving this problem: temporal nonlinear sparsity, weak serial correlation, and discontinuous structural dynamics. In this article, we propose a novel transfer learning model, called DNformer, to predict temporal link sequence in dynamic networks. The structural dynamic evolution is sequenced into consecutive links one by one over time to inhibit temporal nonlinear sparsity. The self-attention of the model is used to capture the serial correlation between the input and output link sequences. Moreover, our structural encoding is designed to obtain changing structures from the consecutive links and to learn the mapping between link sequences. This structural encoding consists of two parts: the node clustering encoding of each link and the link similarity encoding between links. These encodings enable the model to perceive the importance and correlation of links. Furthermore, we introduce a measurement of structural similarity in the loss function for the structural differences of link sequences. The experimental results demonstrate that our model outperforms other state-of-the-art TLP methods such as Transformer, TGAT, and EvolveGCN. It achieves the three highest AUC and four highest precision scores in five different representative dynamic networks problems.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available