K-Core based Temporal Graph Convolutional Network for Dynamic Graphs
arXiv:2003.09902 · doi:10.1109/TKDE.2020.3033829
Abstract
Graph representation learning is a fundamental task in various applications that strives to learn low-dimensional embeddings for nodes that can preserve graph topology information. However, many existing methods focus on static graphs while ignoring evolving graph patterns. Inspired by the success of graph convolutional networks(GCNs) in static graph embedding, we propose a novel k-core based temporal graph convolutional network, the CTGCN, to learn node representations for dynamic graphs. In contrast to previous dynamic graph embedding methods, CTGCN can preserve both local connective proximity and global structural similarity while simultaneously capturing graph dynamics. In the proposed framework, the traditional graph convolution is generalized into two phases, feature transformation and feature aggregation, which gives the CTGCN more flexibility and enables the CTGCN to learn connective and structural information under the same framework. Experimental results on 7 real-world graphs demonstrate that the CTGCN outperforms existing state-of-the-art graph embedding methods in several tasks, including link prediction and structural role classification. The source code of this work can be obtained from \url{https://github.com/jhljx/CTGCN}.
References in corpus (21)
- Adam: A Method for Stochastic Optimization
- Efficient Estimation of Word Representations in Vector Space
- Distilling the Knowledge in a Neural Network
- DeepWalk: Online Learning of Social Representations
- Semi-Supervised Classification with Graph Convolutional Networks
- LINE: Large-scale Information Network Embedding
- Identification of influential spreaders in complex networks
- Graph Neural Networks: A Review of Methods and Applications
- Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks
- Simplifying Graph Convolutional Networks
- struc2vec: Learning Node Representations from Structural Identity
- Vertex similarity in networks
- Betweenness Centrality in Large Complex Networks
- An O(m) Algorithm for Cores Decomposition of Networks
- dyngraph2vec: Capturing Network Dynamics using Dynamic Graph Representation Learning
- Large-Scale Learnable Graph Convolutional Networks
- FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling
- Predict then Propagate: Graph Neural Networks meet Personalized PageRank
- DynGEM: Deep Embedding Method for Dynamic Graphs
- MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing
- Neural Relational Inference for Interacting Systems