arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2005.07869cs.LGstat.ML
收藏

复合核图神经网络

Graph Neural Networks with Composite Kernels

University at Buffalo(布法罗大学)

Yufan Zhou, Jiayi Xian, Changyou Chen, Jinhui Xu

摘要:

近年来,对图结构数据的学习引起了越来越多的兴趣。像图卷积网络(GCN)这样的框架已经证明了它们捕获结构信息的能力,并在各种任务中获得良好的性能。在这些框架中,节点聚合方案通常用于捕获结构信息:节点的特征向量通过聚合其相邻节点的特征来递归计算。然而,大多数聚合方案平等地对待图中的所有连接,忽略了节点特征的相似性。在本文中,我们重新解释的角度来看,核加权的节点聚合,并提出了一个框架,考虑特征相似性的聚合方案。具体地说,我们证明了归一化邻接矩阵等价于Krein空间中的基于邻域的核矩阵。然后,我们提出了特征聚合的组成,原来的邻居为基础的内核和一个可学习的内核编码特征相似性的特征空间。我们进一步展示了如何将所提出的方法扩展到图注意力网络(GAT)。实验结果表明,我们提出的框架在几个现实世界中的应用程序具有更好的性能。

英文摘要:

Learning on graph structured data has drawn increasing interest in recent years. Frameworks like Graph Convolutional Networks (GCNs) have demonstrated their ability to capture structural information and obtain good performance in various tasks. In these frameworks, node aggregation schemes are typically used to capture structural information: a node's feature vector is recursively computed by aggregating features of its neighboring nodes. However, most of aggregation schemes treat all connections in a graph equally, ignoring node feature similarities. In this paper, we re-interpret node aggregation from the perspective of kernel weighting, and present a framework to consider feature similarity in an aggregation scheme. Specifically, we show that normalized adjacency matrix is equivalent to a neighbor-based kernel matrix in a Krein Space. We then propose feature aggregation as the composition of the original neighbor-based kernel and a learnable kernel to encode feature similarities in a feature space. We further show how the proposed method can be extended to Graph Attention Network (GAT). Experimental results demonstrate better performance of our proposed framework in several real-world applications.

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

↑