Learning Convolutional Neural Networks for Graphs

Mohamed Ahmed Mathias Niepert, Konstantin Kutzkov

Proceedings of the 33rd International Conference on Machine Learning (ICML), pp. 2014–2023, 2016.

Abstract

Numerous important problems can be framed as learning from graph data. We propose a framework for learning convolutional neural networks for arbitrary graphs. These graphs may be undirected, directed, and with both discrete and continuous node and edge attributes. Analogous to image-based convolutional networks that operate on locally connected regions of the input, we present a general approach to extracting locally connected regions from graphs. Using established benchmark data sets, we demonstrate that the learned feature representations are competitive with state of the art graph kernels and that their computation is highly efficient.

Links

doi: 10.5555/3045390.3045603

BibTeX

@inproceedings{niepert16_icml, title = {Learning Convolutional Neural Networks for Graphs}, author = {Mathias Niepert, Mohamed Ahmed and Kutzkov, Konstantin}, year = {2016}, booktitle = {Proceedings of the 33rd International Conference on Machine Learning (ICML)}, pages = {2014--2023}, doi = {10.5555/3045390.3045603} }