arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2003.09902cs.LGcs.SIstat.ML

K-Core based Temporal Graph Convolutional Network for Dynamic Graphs

Beihang University(北京航空航天大学);HuaRong RongTong (Beijing) Technology Co., Ltd.(华融通(北京)科技有限公司)

Jingxin Liu, Chang Xu, Chang Yin, Weiqiang Wu, You Song

英文摘要:

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}.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑