4.7 Article

Transition Propagation Graph Neural Networks for Temporal Networks

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TNNLS.2022.3220548

Keywords

Graph embedding; graph neural networks (GNNs); link prediction; social networks; temporal networks

Funding

  1. National Natural Science Foundation of China [U20B2066, 61976186]
  2. Starry Night Science Fund of Zhejiang University Shanghai Institute for Advanced Study [SN-ZJU-SIAS-001]
  3. Fundamental Research Funds for the Central Universities [226-2022-00064]

Ask authors/readers for more resources

This study proposes a method called transition propagation graph neural networks (TIP-GNN) to tackle the challenges of encoding nodes' transition structures. The TIP-GNN approach encodes transition structures through multistep transition propagation and distills information from neighborhoods through bilevel graph convolution, resulting in improved accuracy in temporal link prediction.
Researchers of temporal networks (e.g., social networks and transaction networks) have been interested in mining dynamic patterns of nodes from their diverse interactions. Inspired by recently powerful graph mining methods like skip-gram models and graph neural networks (GNNs), existing approaches focus on generating temporal node embeddings sequentially with nodes' sequential interactions. However, the sequential modeling of previous approaches cannot handles the transition structure between nodes' neighbors with limited memorization capacity. In detail, an effective method for the transition structures is required to both model nodes' personalized patterns adaptively and capture node dynamics accordingly. In this article, we propose a method, namely transition propagation graph neural networks (TIP-GNN), to tackle the challenges of encoding nodes' transition structures. The proposed TIP-GNN focuses on the bilevel graph structure in temporal networks: besides the explicit interaction graph, a node's sequential interactions can also be constructed as a transition graph. Based on the bilevel graph, TIP-GNN further encodes transition structures by multistep transition propagation and distills information from neighborhoods by a bilevel graph convolution. Experimental results over various temporal networks reveal the efficiency of our TIP-GNN, with at most 7.2% improvements of accuracy on temporal link prediction. Extensive ablation studies further verify the effectiveness and limitations of the transition propagation module. Our code is available at https://github.com/doujiang-zheng/TIP-GNN.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available