Abstract
We generalize the scattering transform to graphs and consequently construct a convolutional neural network on graphs. We show that under certain conditions, any feature generated by such a network is approximately invariant to permutations and stable to signal and graph manipulations. Numerical results demonstrate competitive performance on relevant datasets.
Original language | English (US) |
---|---|
Pages (from-to) | 1046-1074 |
Number of pages | 29 |
Journal | Applied and Computational Harmonic Analysis |
Volume | 49 |
Issue number | 3 |
DOIs | |
State | Published - Nov 2020 |
Bibliographical note
Publisher Copyright:© 2019 Elsevier Inc.
Keywords
- Feature learning
- Graph convolution
- Graph neural networks
- Permutation invariance
- Scattering transform
- Spectral graph theory
- Wavelets