Exploiting Triangle Patterns for Heterogeneous Graph Attention Network

Abstract

Recently, graph neural networks (GNNs) have been improved under the influence of various deep learning techniques, such as attention, autoencoders, and recurrent networks. However, real-world graphs may have multiple types of vertices and edges, such as graphs of social networks, citation networks, and e-commerce data. In these cases, most GNNs that consider a homogeneous graph as input data are not suitable because they ignore the heterogeneity. Meta-path-based methods have been researched to capture both heterogeneity and structural information of heterogeneous graphs. As a meta-path is a type of graph pattern, we extend the use of meta-paths to exploit graph patterns. In this study, we propose TP-HAN, a heterogeneous graph attention network for exploiting triangle patterns. In the experiments using DBLP and IMDB, we show that TP-HAN outperforms the state-of-the-art heterogeneous graph attention network. © 2022, Springer Nature Switzerland AG.