Learning Heterogeneous Graph Embedding with Metapath-Based Aggregation for Link Prediction

Chengdong Zhang, Keke Li, Shaoqing Wang (), Bin Zhou, Lei Wang and Fuzhen Sun
Additional contact information
Chengdong Zhang: School of Computer Science and Technology, Shandong University of Technology, Zibo 255091, China
Keke Li: School of Computer Science and Technology, Shandong University of Technology, Zibo 255091, China
Shaoqing Wang: School of Computer Science and Technology, Shandong University of Technology, Zibo 255091, China
Bin Zhou: School of Computer Science and Technology, Shandong University of Technology, Zibo 255091, China
Lei Wang: School of Computer Science and Technology, Shandong University of Technology, Zibo 255091, China
Fuzhen Sun: School of Computer Science and Technology, Shandong University of Technology, Zibo 255091, China

Mathematics, 2023, vol. 11, issue 3, 1-18

Abstract: Along with the growth of graph neural networks (GNNs), many researchers have adopted metapath-based GNNs to handle complex heterogeneous graph embedding. The conventional definition of a metapath only distinguishes whether there is a connection between nodes in the network schema, where the type of edge is ignored. This leads to inaccurate node representation and subsequently results in suboptimal prediction performance. In heterogeneous graphs, a node can be connected by multiple types of edges. In fact, each type of edge represents one kind of scene. The intuition is that if the embedding of nodes is trained under different scenes, the complete representation of nodes can be obtained by organically combining them. In this paper, we propose a novel definition of a metapath whereby the edge type, i.e., the relation between nodes, is integrated into it. A heterogeneous graph can be considered as the compound of multiple relation subgraphs from the view of a novel metapath. In different subgraphs, the embeddings of a node are separately trained by encoding and aggregating the neighbors of the intrapaths, which are the instance levels of a novel metapath. Then, the final embedding of the node is obtained by the use of the attention mechanism which aggregates nodes from the interpaths, which is the semantic level of the novel metapaths. Link prediction is a downstream task by which to evaluate the effectiveness of the learned embeddings. We conduct extensive experiments on three real-world heterogeneous graph datasets for link prediction. The empirical results show that the proposed model outperforms the state-of-the-art baselines; in particular, when comparing it to the best baseline, the F1 metric is increased by 10.35% over an Alibaba dataset.

Keywords: graph neural network; heterogeneous graph; metapath; link prediction (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://www.mdpi.com/2227-7390/11/3/578/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/3/578/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:11:y:2023:i:3:p:578-:d:1043616

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().