Abstract
Recently, many researchers have been focusing on the definition of neural networks for graphs. The basic component for many of these approaches remains the graph convolution idea proposed almost a decade ago. In this paper, we extend this basic component, following an intuition derived from the well-known convolutional filters over multi-dimensional tensors. In particular, we derive a simple, efficient and effective way to introduce a hyper-parameter on graph convolutions that influences the filter size, i.e., its receptive field over the considered graph. We show with experimental results on real-world graph datasets that the proposed graph convolutional filter improves the predictive performance of Deep Graph Convolutional Networks.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 2018 IEEE Symposium Series on Computational Intelligence, SSCI 2018 |
| Editors | Suresh Sundaram |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 1534-1541 |
| Number of pages | 8 |
| ISBN (Electronic) | 9781538692769 |
| DOIs | |
| State | Published - 2 Jul 2018 |
| Externally published | Yes |
| Event | 8th IEEE Symposium Series on Computational Intelligence, SSCI 2018 - Bangalore, India Duration: 18 Nov 2018 → 21 Nov 2018 |
Publication series
| Name | Proceedings of the 2018 IEEE Symposium Series on Computational Intelligence, SSCI 2018 |
|---|
Conference
| Conference | 8th IEEE Symposium Series on Computational Intelligence, SSCI 2018 |
|---|---|
| Country/Territory | India |
| City | Bangalore |
| Period | 18/11/18 → 21/11/18 |
Bibliographical note
Publisher Copyright:© 2018 IEEE.
Keywords
- Convolutional neural networks for graphs
- deep learning for graphs
- graph convolution
- graphs
ASJC Scopus subject areas
- Artificial Intelligence
- Theoretical Computer Science