PathSAGE: Spatial Graph Attention Neural Networks With Random Path Sampling
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
HGATE: Heterogeneous Graph Attention Auto-Encoders
Heterogeneous Graph Attention Network With Multimodal Feature Selection for Cancer Multiomics Integration
Following the Clues: Experiments on Person Re-ID using Cross-Modal Intelligence
AST-Enhanced or AST-Overloaded? The Surprising Impact of Hybrid Graph Representations on Code Clone Detection
STAMImputer: Spatio-Temporal Attention MoE for Traffic Data Imputation
Learning Pyramid-structured Long-range Dependencies for 3D Human Pose Estimation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.