arrow
Return

Empowering Simple Graph Convolutional Networks

delete2024-04-01
delete8
PRE
AI
L
Luca Pasa *
N
Nicolò Navarin
W
Wolfgang Erb
A
Alessandro Sperduti
DOI:10.1109/TNNLS.2022.3232291delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Many neural networks for graphs are based on the graph convolution (GC) operator, proposed more than a decade ago. Since then, many alternative definitions have been proposed, which tend to add complexity (and nonlinearity) to the model. Recently, however, a simplified GC operator, dubbed simple graph convolution (SGC), which aims to remove nonlinearities was proposed. Motivated by the good results reached by this simpler model, in this article we propose, analyze, and compare simple graph convolution operators of increasing complexity that rely on linear transformations or controlled nonlinearities, and that can be implemented in single-layer graph convolutional networks (GCNs). Their computational expressiveness is characterized as well. We show that the predictive performance of the proposed GC operators is competitive with the ones of other widely adopted models on the considered node classification benchmark datasets.
Keywords:
Deep learning
graph convolution (GC)
graph neural network (GNN)
machine learning on graphs
structured data

Journal

IEEE Transactions on Neural Networks and Learning Systems cover
IEEE Transactions on Neural Networks and Learning Systems
IF:
8.9
Papers:
7.5K
Citations:
7.2W

Organization

U
University of Padua
Scholars:
5.1W
Papers: 4.3W
Citations: 57