On Filter Size in Graph Convolutional Networks

Dinh V. Tran, Nicolò Navarin, Alessandro Sperduti

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

58 Scopus citations

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 languageEnglish
Title of host publicationProceedings of the 2018 IEEE Symposium Series on Computational Intelligence, SSCI 2018
EditorsSuresh Sundaram
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1534-1541
Number of pages8
ISBN (Electronic)9781538692769
DOIs
StatePublished - 2 Jul 2018
Externally publishedYes
Event8th IEEE Symposium Series on Computational Intelligence, SSCI 2018 - Bangalore, India
Duration: 18 Nov 201821 Nov 2018

Publication series

NameProceedings of the 2018 IEEE Symposium Series on Computational Intelligence, SSCI 2018

Conference

Conference8th IEEE Symposium Series on Computational Intelligence, SSCI 2018
Country/TerritoryIndia
CityBangalore
Period18/11/1821/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

Fingerprint

Dive into the research topics of 'On Filter Size in Graph Convolutional Networks'. Together they form a unique fingerprint.

Cite this