The reviewed record of science sign in
Pith

arxiv: 2109.02868 · v1 · pith:MA2TW3AZ · submitted 2021-09-07 · cs.AI · cs.LG· cs.SI

HMSG: Heterogeneous Graph Neural Network based on Metapath Subgraph Learning

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:MA2TW3AZrecord.jsonopen to challenge →

classification cs.AI cs.LGcs.SI
keywords heterogeneousinformationgraphnodehmsghomogeneousneighborsnetwork
0
0 comments X
read the original abstract

Many real-world data can be represented as heterogeneous graphs with different types of nodes and connections. Heterogeneous graph neural network model aims to embed nodes or subgraphs into low-dimensional vector space for various downstream tasks such as node classification, link prediction, etc. Although several models were proposed recently, they either only aggregate information from the same type of neighbors, or just indiscriminately treat homogeneous and heterogeneous neighbors in the same way. Based on these observations, we propose a new heterogeneous graph neural network model named HMSG to comprehensively capture structural, semantic and attribute information from both homogeneous and heterogeneous neighbors. Specifically, we first decompose the heterogeneous graph into multiple metapath-based homogeneous and heterogeneous subgraphs, and each subgraph associates specific semantic and structural information. Then message aggregation methods are applied to each subgraph independently, so that information can be learned in a more targeted and efficient manner. Through a type-specific attribute transformation, node attributes can also be transferred among different types of nodes. Finally, we fuse information from subgraphs together to get the complete representation. Extensive experiments on several datasets for node classification, node clustering and link prediction tasks show that HMSG achieves the best performance in all evaluation metrics than state-of-the-art baselines.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.