arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2004.13970cs.LGstat.ML
收藏

有向图卷积网络

Directed Graph Convolutional Network

National University of Singapore(新加坡国立大学)

Zekun Tong, Yuxuan Liang, Changsheng Sun, David S. Rosenblum, Andrew Lim

摘要:

图卷积网络由于其在处理图结构数据方面的优异性能而得到了广泛的应用。然而,无向图限制了它们的应用范围。本文利用一阶和二阶邻近性将基于谱的图卷积扩展到有向图,既保留了有向图的连通性,又扩大了卷积运算的感受域。一个新的GCN模型,称为DGCN,然后被设计为学习表示的有向图,利用第一和第二阶邻近信息。我们的经验表明,GCN只与DGCN的工作可以从图中编码更多有用的信息,并有助于实现更好的性能时,推广到其他模型。此外,在引文网络和共同购买数据集上的大量实验表明,我们的模型相对于最先进的方法的优越性。

英文摘要:

Graph Convolutional Networks (GCNs) have been widely used due to their outstanding performance in processing graph-structured data. However, the undirected graphs limit their application scope. In this paper, we extend spectral-based graph convolution to directed graphs by using first- and second-order proximity, which can not only retain the connection properties of the directed graph, but also expand the receptive field of the convolution operation. A new GCN model, called DGCN, is then designed to learn representations on the directed graph, leveraging both the first- and second-order proximity information. We empirically show the fact that GCNs working only with DGCNs can encode more useful information from graph and help achieve better performance when generalized to other models. Moreover, extensive experiments on citation networks and co-purchase datasets demonstrate the superiority of our model against the state-of-the-art methods.

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

↑