.png){kind=icon}
返回
DyGCN: Efficient Dynamic Graph Embedding With Graph Convolutional Network
.png){kind=icon}
PRE
AI
DOI：10.1109/TNNLS.2022.3185527.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Graph embedding, aiming to learn low-dimensional representations (aka. embeddings) of nodes in graphs, has received significant attention. In recent years, there has been a surge of efforts, among which graph convolutional networks (GCNs) have emerged as an effective class of models. However, these methods mainly focus on the static graph embedding. In the present work, an efficient dynamic graph embedding approach is proposed, called dynamic GCN (DyGCN), which is an extension of the GCN-based methods. The embedding propagation scheme of GCN is naturally generalized to a dynamic setting in an efficient manner, which propagates the change in topological structure and neighborhood embeddings along the graph to update the node embeddings. The most affected nodes are updated first, and then their changes are propagated to further nodes, which in turn are updated. Extensive experiments on various dynamic graphs showed that the proposed model can update the node embeddings in a time-saving and performance-preserving way.
Keyword:
Dynamic graphs
graph convolutional network (GCN)
neural network
期刊
IF:
8.9
论文数:
7.5K
被引数:
7.2W
机构
引用论文
Insurance activity and economic performance: Fresh evidence from asymmetric panel causality tests
OAAI
OAAI分享收藏Passive signal propagation and membrane properties in median photoreceptors of the giant barnacleOAAI
OAAI分享收藏Oscillatory activity is not evident in the primate temporal visual cortex with static stimuli.png)
NeuroReport
NeuroReportIF0
PREAI
分享收藏Economic benefit evaluation method for the micro-grid renewable energy system operation微网可再生能源系统运行经济效益评价方法
PREAI
分享收藏
查看更多内容