Abstract

Graph neural network, as a deep learning based graph representation technology, can capture the structural information encapsulated in graphs well and generate more effective feature embedding. We have recently witnessed an emerging research interests on it. However, existing models are primarily focused on handling homogeneous graphs. When designing graph neural networks for heterogeneous graphs, heterogeneity and rich semantic information bring great challenges. In this paper, we extend graph neural network to heterogeneous graph scenes, and propose a novel high-order Symmetric Relation based Heterogeneous Graph Attention Network, denoted as SR-HGAT, which takes into account the features of nodes and high-order relations simultaneously, and exploits the two-layer attention mechanism based aggregator to efficiently capture essential semantics in an end-to-end manner. The proposed SR-HGAT first identifies the latent semantics underneath the observed explicit symmetric relations guided by different meta-paths and meta-graphs in a heterogeneous graph. The nested propagation mechanism for aggregating semantic and structural features that different links contain is then designed to calculate the interaction strength of each symmetric relation. As the core of the proposed model, to comprehensively capture both the structural and semantic feature information, a two-layer attention mechanism is applied to learn the importance of different neighborhood information as well as the weights of different symmetric relations. These latent semantics are then automatically fused to obtain unified embeddings for specific mining tasks. Extensive experimental results offer insights into the efficacy of the proposed model and have demonstrated that it significantly outperforms state-of-the-art baselines across three benchmark datasets on various downstream tasks.

Highlights

  • Graphs are one of the most expressive data structures which have been used to model a variety of problems

  • In light of previous limitations and challenges, we propose a high-order Symmetric Relation based Heterogeneous Graph Attention Network framework(SR-HGAT)

  • SR-HGAT: SYMMETRIC RELATIONS BASED HETEROGENEOUS GRAPH ATTENTION NETWORK In this paper, we extend graph attention network to heterogeneous graph scenes, and propose a semi-supervised Symmetric Relation Based Heterogeneous Graph Attention Network, denoted as SR-HGAT, to take into account the features of nodes and high-order symmetric relations simultaneously, and adopt a two-layer hierarchical attention mechanism to embed heterogeneous graph in an end-to-end fashion

Read more

Summary

INTRODUCTION

Graphs are one of the most expressive data structures which have been used to model a variety of problems. Zhang et al [28] present the heterogeneous graph neural networks (HetGNN) that adopts different RNNs for different node types to integrate multi-modal features These methods have been shown to be empirically better than traditional models, they have not fully utilized the heterogeneous graphs’ properties. Definition 1 (Meta-Path): As an abstract sequence of node types connected by link types, the meta-path is formed by transforms of a graph schema and able to capture rich semantic information preserved in heterogeneous graphs. A heterogeneous graph schema G = (A, R), the corresponding meta-graph can be represented as a directed acyclic graph MG = (N , M , ns, nt ), which contains a source node ns (in-degree: 0) and a target node nt (out-degree: 0) It depicts a complex semantic relation formed between ns and nt by stitching. C. SYMMETRIC RELATIONS In heterogeneous graphs, there are various relationships between two same-typed nodes guided by meta-paths and meta-graphs. We only choose important and meaningful symmetric relations in this paper

SR-HGAT
MODEL INPUTS
NESTED PROPAGATION OF MULTI-TYPED LINK FEATURES
MODEL OPTIMIZATION
EXPERIMENTAL EVALUATION
Findings
CONCLUSION AND FUTURE WORK

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.