Graph Based Convolutional Neural Network
Michael Edwards, Xianghua Xie

TL;DR
This paper introduces a graph convolutional neural network that extends deep learning techniques to irregular spatial domains using graph signal processing, demonstrating high accuracy on MNIST data.
Contribution
It proposes novel graph convolution and pooling operators, along with gradient calculations, enabling deep learning on irregular graph-structured data.
Findings
Achieved 94.96% accuracy on irregular MNIST data
Demonstrated effective localization with spectral multipliers
Compared favorably to standard CNN on regular grid
Abstract
The benefit of localized features within the regular domain has given rise to the use of Convolutional Neural Networks (CNNs) in machine learning, with great proficiency in the image classification. The use of CNNs becomes problematic within the irregular spatial domain due to design and convolution of a kernel filter being non-trivial. One solution to this problem is to utilize graph signal processing techniques and the convolution theorem to perform convolutions on the graph of the irregular domain to obtain feature map responses to learnt filters. We propose graph convolution and pooling operators analogous to those in the regular domain. We also provide gradient calculations on the input data and spectral filters, which allow for the deep learning of an irregular spatial domain problem. Signal filters take the form of spectral multipliers, applying convolution in the graph spectral…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Complex Network Analysis Techniques · Text and Document Classification Technologies
MethodsConvolution
