LookHops: light multi-order convolution and pooling for graph classification

Abstract

Convolution and pooling are the key operations to learn hierarchical representation for graph classification, where more expressive $k$-order($k>1$) method requires more computation cost, limiting the further applications. In this paper, we investigate the strategy of selecting $k$ via neighborhood information gain and propose light $k$-order convolution and pooling requiring fewer parameters while improving the performance. Comprehensive and fair experiments through six graph classification benchmarks show: 1) the performance improvement is consistent to the $k$-order information gain. 2) the proposed convolution requires fewer parameters while providing competitive results. 3) the proposed pooling outperforms SOTA algorithms in terms of efficiency and performance.

arXiv comment9 pages, 5 figures

References in corpus (9)

• Semi-Supervised Classification with Graph Convolutional Networks
• Inductive Representation Learning on Large Graphs
• Spectral Networks and Locally Connected Networks on Graphs
• Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering
• Simplifying Graph Convolutional Networks
• MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing
• Hierarchical Graph Pooling with Structure Learning
• Edge Contraction Pooling for Graph Neural Networks
• iPool -- Information-based Pooling in Hierarchical Graph Neural Networks