Graph Classification via Deep Learning with Virtual Nodes

Abstract

Learning representation for graph classification turns a variable-size graph into a fixed-size vector (or matrix). Such a representation works nicely with algebraic manipulations. Here we introduce a simple method to augment an attributed graph with a virtual node that is bidirectionally connected to all existing nodes. The virtual node represents the latent aspects of the graph, which are not immediately available from the attributes and local connectivity structures. The expanded graph is then put through any node representation method. The representation of the virtual node is then the representation of the entire graph. In this paper, we use the recently introduced Column Network for the expanded graph, resulting in a new end-to-end graph classification model dubbed Virtual Column Network (VCN). The model is validated on two tasks: (i) predicting bio-activity of chemical compounds, and (ii) finding software vulnerability from source code. Results demonstrate that VCN is competitive against well-established rivals.

References in corpus (9)

• Adam: A Method for Stochastic Optimization
• Distributed Representations of Sentences and Documents
• Geometric deep learning: going beyond Euclidean data
• Deep Convolutional Networks on Graph-Structured Data
• Learning Convolutional Neural Networks for Graphs
• Diffusion-Convolutional Neural Networks
• Highway and Residual Networks learn Unrolled Iterative Estimation
• Modeling Relational Data with Graph Convolutional Networks
• One Size Fits Many: Column Bundle for Multi-X Learning

Cited by in corpus (2)

• Graph Warp Module: an Auxiliary Module for Boosting the Power of Graph Neural Networks in Molecular Graph Analysis
• Weisfeiler-Lehman Embedding for Molecular Graph Neural Networks