Graph Neural Networks with Composite Kernels

by   Yufan Zhou, et al.

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.



There are no comments yet.


page 1

page 2

page 3

page 4


Node Similarity Preserving Graph Convolutional Networks

Graph Neural Networks (GNNs) have achieved tremendous success in various...

Node2Seq: Towards Trainable Convolutions in Graph Neural Networks

Investigating graph feature learning becomes essentially important with ...

Geom-GCN: Geometric Graph Convolutional Networks

Message-passing neural networks (MPNNs) have been successfully applied t...

Permutohedral-GCN: Graph Convolutional Networks with Global Attention

Graph convolutional networks (GCNs) update a node's feature vector by ag...

Rethinking Kernel Methods for Node Representation Learning on Graphs

Graph kernels are kernel methods measuring graph similarity and serve as...

Graph Information Vanishing Phenomenon inImplicit Graph Neural Networks

One of the key problems of GNNs is how to describe the importance of nei...

Graph Representation Learning via Hard and Channel-Wise Attention Networks

Attention operators have been widely applied in various fields, includin...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.