Learning Vertex Convolutional Networks for Graph Classification
This addresses graph classification for researchers, but it appears incremental as it builds on existing convolutional network approaches.
The paper tackles graph classification by transforming graphs into fixed-sized aligned vertex grids and defining a new vertex convolution operation, resulting in a model that integrates structural correspondence and minimizes information loss, with experiments showing effectiveness on standard datasets.
In this paper, we develop a new aligned vertex convolutional network model to learn multi-scale local-level vertex features for graph classification. Our idea is to transform the graphs of arbitrary sizes into fixed-sized aligned vertex grid structures, and define a new vertex convolution operation by adopting a set of fixed-sized one-dimensional convolution filters on the grid structure. We show that the proposed model not only integrates the precise structural correspondence information between graphs but also minimises the loss of structural information residing on local-level vertices. Experiments on standard graph datasets demonstrate the effectiveness of the proposed model.