MAGNN: Metapath Aggregated Graph Neural Network for Heterogeneous Graph Embedding

• URL: http://arxiv.org/abs/2002.01680v2
• Date: Tue, 31 Mar 2020 03:51:52 GMT
• Title: MAGNN: Metapath Aggregated Graph Neural Network for Heterogeneous Graph Embedding
• Authors: Xinyu Fu, Jiani Zhang, Ziqiao Meng, Irwin King
• Abstract summary: We propose a new model named Metapath Aggregated Graph Neural Network (MAGNN) to boost the final performance. MAGNN employs three major components, i.e., the node content transformation to encapsulate input node attributes, the intra-metapath aggregation to incorporate intermediate semantic nodes, and the inter-metapath aggregation to combine messages from multiple metapaths. Experiments show that MAGNN achieves more accurate prediction results than state-of-the-art baselines.
• Score: 36.6390478350677
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A large number of real-world graphs or networks are inherently heterogeneous, involving a diversity of node types and relation types. Heterogeneous graph embedding is to embed rich structural and semantic information of a heterogeneous graph into low-dimensional node representations. Existing models usually define multiple metapaths in a heterogeneous graph to capture the composite relations and guide neighbor selection. However, these models either omit node content features, discard intermediate nodes along the metapath, or only consider one metapath. To address these three limitations, we propose a new model named Metapath Aggregated Graph Neural Network (MAGNN) to boost the final performance. Specifically, MAGNN employs three major components, i.e., the node content transformation to encapsulate input node attributes, the intra-metapath aggregation to incorporate intermediate semantic nodes, and the inter-metapath aggregation to combine messages from multiple metapaths. Extensive experiments on three real-world heterogeneous graph datasets for node classification, node clustering, and link prediction show that MAGNN achieves more accurate prediction results than state-of-the-art baselines.

Related papers

• HAGNN: Hybrid Aggregation for Heterogeneous Graph Neural Networks [15.22198175691658]
  Heterogeneous graph neural networks (GNNs) have been successful in handling heterogeneous graphs. Recent work pointed out that simple homogeneous graph model without meta-path can also achieve comparable results. We propose a novel framework to utilize the rich type semantic information in heterogeneous graphs comprehensively, namely HAGNN.
  arXiv  Detail & Related papers  (2023-07-04T10:40:20Z)
• Seq-HGNN: Learning Sequential Node Representation on Heterogeneous Graph [57.2953563124339]
  We propose a novel heterogeneous graph neural network with sequential node representation, namely Seq-HGNN. We conduct extensive experiments on four widely used datasets from Heterogeneous Graph Benchmark (HGB) and Open Graph Benchmark (OGB)
  arXiv  Detail & Related papers  (2023-05-18T07:27:18Z)
• Meta-Path Based Attentional Graph Learning Model for Vulnerability Detection [21.10614864296154]
  We propose a Meta-path based Attentional Graph learning model for code vulNErability deTection, called MAGNET. A meta-path based hierarchical attentional graph neural network is also proposed to capture the relations between distant nodes in the graph. We evaluate MAGNET on three public datasets and the results show that MAGNET outperforms the best baseline method in terms of F1 score by 6.32%, 21.50%, and 25.40%, respectively.
  arXiv  Detail & Related papers  (2022-12-29T11:51:47Z)
• MECCH: Metapath Context Convolution-based Heterogeneous Graph Neural Networks [45.68142605304948]
  Heterogeneous graph neural networks (HGNNs) were proposed for representation learning on structural data with multiple types of nodes and edges. We present a novel Metapath Context Convolution-based Heterogeneous Graph Neural Network (MECCH)
  arXiv  Detail & Related papers  (2022-11-23T09:13:33Z)
• 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)
• Explicit Pairwise Factorized Graph Neural Network for Semi-Supervised Node Classification [59.06717774425588]
  We propose the Explicit Pairwise Factorized Graph Neural Network (EPFGNN), which models the whole graph as a partially observed Markov Random Field. It contains explicit pairwise factors to model output-output relations and uses a GNN backbone to model input-output relations. We conduct experiments on various datasets, which shows that our model can effectively improve the performance for semi-supervised node classification on graphs.
  arXiv  Detail & Related papers  (2021-07-27T19:47:53Z)
• Higher-Order Attribute-Enhancing Heterogeneous Graph Neural Networks [67.25782890241496]
  We propose a higher-order Attribute-Enhancing Graph Neural Network (HAEGNN) for heterogeneous network representation learning. HAEGNN simultaneously incorporates meta-paths and meta-graphs for rich, heterogeneous semantics. It shows superior performance against the state-of-the-art methods in node classification, node clustering, and visualization.
  arXiv  Detail & Related papers  (2021-04-16T04:56:38Z)
• Metapaths guided Neighbors aggregated Network for?Heterogeneous Graph Reasoning [5.228629954007088]
  We propose a Metapaths-guided Neighbors-aggregated Heterogeneous Graph Neural Network to improve performance. We conduct extensive experiments for the proposed MHN on three real-world heterogeneous graph datasets.
  arXiv  Detail & Related papers  (2021-03-11T05:42:06Z)
• Learning the Implicit Semantic Representation on Graph-Structured Data [57.670106959061634]
  Existing representation learning methods in graph convolutional networks are mainly designed by describing the neighborhood of each node as a perceptual whole. We propose a Semantic Graph Convolutional Networks (SGCN) that explores the implicit semantics by learning latent semantic-paths in graphs.
  arXiv  Detail & Related papers  (2021-01-16T16:18:43Z)

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.