SPAGAN: Shortest Path Graph Attention Network

• URL: http://arxiv.org/abs/2101.03464v1
• Date: Sun, 10 Jan 2021 03:18:34 GMT
• Title: SPAGAN: Shortest Path Graph Attention Network
• Authors: Yiding Yang, Xinchao Wang, Mingli Song, Junsong Yuan, Dacheng Tao
• Abstract summary: Graph convolutional networks (GCN) have recently demonstrated their potential in analyzing non-grid structure data that can be represented as graphs. We propose a novel GCN model, which we term as Shortest Path Graph Attention Network (SPAGAN)
• Score: 187.75441278910708
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Graph convolutional networks (GCN) have recently demonstrated their potential in analyzing non-grid structure data that can be represented as graphs. The core idea is to encode the local topology of a graph, via convolutions, into the feature of a center node. In this paper, we propose a novel GCN model, which we term as Shortest Path Graph Attention Network (SPAGAN). Unlike conventional GCN models that carry out node-based attentions within each layer, the proposed SPAGAN conducts path-based attention that explicitly accounts for the influence of a sequence of nodes yielding the minimum cost, or shortest path, between the center node and its higher-order neighbors. SPAGAN therefore allows for a more informative and intact exploration of the graph structure and further {a} more effective aggregation of information from distant neighbors into the center node, as compared to node-based GCN methods. We test SPAGAN on the downstream classification task on several standard datasets, and achieve performances superior to the state of the art. Code is publicly available at https://github.com/ihollywhy/SPAGAN.

Related papers

• SAILOR: Structural Augmentation Based Tail Node Representation Learning [49.19653803667422]
  Graph Neural Networks (GNNs) have achieved state-of-the-art performance in representation learning for graphs recently. Most of the graphs in real-world scenarios follow a long-tailed distribution on their node degrees, that is, a vast majority of the nodes in the graph are tail nodes with only a few connected edges. We propose a general Structural Augmentation based taIL nOde Representation learning framework, dubbed as SAILOR, which can jointly learn to augment the graph structure and extract more informative representations for tail nodes.
  arXiv  Detail & Related papers  (2023-08-13T16:04:03Z)
• Structure Enhanced Graph Neural Networks for Link Prediction [6.872826041648584]
  We propose Structure Enhanced Graph neural network (SEG) for link prediction. SEG incorporates surrounding topological information of target nodes into an ordinary GNN model. Experiments on the OGB link prediction datasets demonstrate that SEG achieves state-of-the-art results.
  arXiv  Detail & Related papers  (2022-01-14T03:49:30Z)
• SHGNN: Structure-Aware Heterogeneous Graph Neural Network [77.78459918119536]
  This paper proposes a novel Structure-Aware Heterogeneous Graph Neural Network (SHGNN) to address the above limitations. We first utilize a feature propagation module to capture the local structure information of intermediate nodes in the meta-path. Next, we use a tree-attention aggregator to incorporate the graph structure information into the aggregation module on the meta-path. Finally, we leverage a meta-path aggregator to fuse the information aggregated from different meta-paths.
  arXiv  Detail & Related papers  (2021-12-12T14:18:18Z)
• SStaGCN: Simplified stacking based graph convolutional networks [2.556756699768804]
  Graph convolutional network (GCN) is a powerful model studied broadly in various graph structural data learning tasks. We propose a novel GCN called SStaGCN (Simplified stacking based GCN) by utilizing the ideas of stacking and aggregation. We show that SStaGCN can efficiently mitigate the over-smoothing problem of GCN.
  arXiv  Detail & Related papers  (2021-11-16T05:00:08Z)
• Reasoning Graph Networks for Kinship Verification: from Star-shaped to Hierarchical [85.0376670244522]
  We investigate the problem of facial kinship verification by learning hierarchical reasoning graph networks. We develop a Star-shaped Reasoning Graph Network (S-RGN) to exploit more powerful and flexible capacity. We also develop a Hierarchical Reasoning Graph Network (H-RGN) to exploit more powerful and flexible capacity.
  arXiv  Detail & Related papers  (2021-09-06T03:16:56Z)
• Schema-Aware Deep Graph Convolutional Networks for Heterogeneous Graphs [10.526065883783899]
  Graph convolutional network (GCN) based approaches have achieved significant progress for solving complex, graph-structured problems. We propose our GCN framework 'Deep Heterogeneous Graph Convolutional Network (DHGCN)' It takes advantage of the schema of a heterogeneous graph and uses a hierarchical approach to effectively utilize information many hops away.
  arXiv  Detail & Related papers  (2021-05-03T06:24:27Z)
• Semi-Supervised Node Classification by Graph Convolutional Networks and Extracted Side Information [18.07347677181108]
  This paper revisits the node classification task in a semi-supervised scenario by graph convolutional networks (GCNs) The goal is to benefit from the flow of information that circulates around the revealed node labels.
  arXiv  Detail & Related papers  (2020-09-29T02:38:58Z)
• DeeperGCN: All You Need to Train Deeper GCNs [66.64739331859226]
  Graph Convolutional Networks (GCNs) have been drawing significant attention with the power of representation learning on graphs. Unlike Convolutional Neural Networks (CNNs), which are able to take advantage of stacking very deep layers, GCNs suffer from vanishing gradient, over-smoothing and over-fitting issues when going deeper. This paper proposes DeeperGCN that is capable of successfully and reliably training very deep GCNs.
  arXiv  Detail & Related papers  (2020-06-13T23:00:22Z)
• Unifying Graph Convolutional Neural Networks and Label Propagation [73.82013612939507]
  We study the relationship between LPA and GCN in terms of two aspects: feature/label smoothing and feature/label influence. Based on our theoretical analysis, we propose an end-to-end model that unifies GCN and LPA for node classification. Our model can also be seen as learning attention weights based on node labels, which is more task-oriented than existing feature-based attention models.
  arXiv  Detail & Related papers  (2020-02-17T03:23:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.