PathSAGE: Spatial Graph Attention Neural Networks With Random Path Sampling
Not on the map. Why?
Abstract (arXiv)
Graph Convolutional Networks (GCNs) achieve great success in non-Euclidean structure data processing recently. In existing studies, deeper layers are used in CCNs to extract deeper features of Euclidean structure data. However, for non-Euclidean structure data, too deep GCNs will confront with problems like "neighbor explosion" and "over-smoothing", it also cannot be applied to large datasets. To address these problems, we propose a model called PathSAGE, which can learn high-order topological information and improve the model's performance by expanding the receptive field. The model randomly samples paths starting from the central node and aggregates them by Transformer encoder. PathSAGE has only one layer of structure to aggregate nodes which avoid those problems above. The results of evaluation shows that our model achieves comparable performance with the state-of-the-art models in inductive learning tasks.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 22 of its 25 references that are in the map. First posted on arXiv 11 Mar 2022.
Builds on
22 of 25 references.
References · 22
- 2017Attention Is All You Needcited by 59,932
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,085
- 2018Graph Neural Networks: A Review of Methods and Applicationscited by 1,571
- 2018Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learningcited by 1,099
- 2013Spectral Networks and Locally Connected Networks on Graphscited by 1,097
- 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 987
- 2018Hierarchical Graph Representation Learning with Differentiable Poolingcited by 786
- 2019GraphSAINT: Graph Sampling Based Inductive Learning Methodcited by 618
10 more
- 2018FastGCN: Fast Learning with Graph Convolutional Networks via Importance Samplingcited by 583
- 2019Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networkscited by 540
- 2016Geometric deep learning on graphs and manifolds using mixture model CNNscited by 468
- 2018Adaptive Sampling Towards Fast Graph Representation Learningcited by 180
- 2018GaAN: Gated Attention Networks for Learning on Large and Spatiotemporal Graphscited by 164
- 2018Large-Scale Learnable Graph Convolutional Networkscited by 113
- 2018GeniePath: Graph Neural Networks with Adaptive Receptive Pathscited by 66
- 2019UER: An Open-Source Toolkit for Pre-training Modelscited by 61
- 2018Accurate, Efficient and Scalable Graph Embeddingcited by 35
- 2021SPAGAN: Shortest Path Graph Attention Networkcited by 28
Built on by
Not cited yet.