Learning Deep Graph Representations via Convolutional Neural Networks

Abstract

Graph-structured data arise in many scenarios. A fundamental problem is to quantify the similarities of graphs for tasks such as classification. R-convolution graph kernels are positive-semidefinite functions that decompose graphs into substructures and compare them. One problem in the effective implementation of this idea is that the substructures are not independent, which leads to high-dimensional feature space. In addition, graph kernels cannot capture the high-order complex interactions between vertices. To mitigate these two problems, we propose a framework called DeepMap to learn deep representations for graph feature maps. The learned deep representation for a graph is a dense and low-dimensional vector that captures complex high-order interactions in a vertex neighborhood. DeepMap extends Convolutional Neural Networks (CNNs) to arbitrary graphs by generating aligned vertex sequences and building the receptive field for each vertex. We empirically validate DeepMap on various graph classification benchmarks and demonstrate that it achieves state-of-the-art performance.

arXiv commentarXiv admin note: text overlap with arXiv:2002.09846

References in corpus (9)

• Spectral Networks and Locally Connected Networks on Graphs
• Deep Convolutional Networks on Graph-Structured Data
• Neural Tangent Kernel: Convergence and Generalization in Neural Networks
• Diffusion-Convolutional Neural Networks
• On Exact Computation with an Infinitely Wide Neural Net
• Subgraph Matching Kernels for Attributed Graphs
• Graph Neural Tangent Kernel: Fusing Graph Neural Networks with Graph Kernels
• On Valid Optimal Assignment Kernels and Applications to Graph Classification
• Tree++: Truncated Tree Based Graph Kernels

Cited by in corpus (1)

• Knowledge Graph Contrastive Learning Based on Relation-Symmetrical Structure