HMSG: Heterogeneous Graph Neural Network based on Metapath Subgraph Learning
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912163970416640 |
|---|---|
| author | Cai, Xinjun Shang, Jiaxing Hao, Fei Liu, Dajiang Zheng, Linjiang |
| author_facet | Cai, Xinjun Shang, Jiaxing Hao, Fei Liu, Dajiang Zheng, Linjiang |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2109_02868 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | HMSG: Heterogeneous Graph Neural Network based on Metapath Subgraph Learning Cai, Xinjun Shang, Jiaxing Hao, Fei Liu, Dajiang Zheng, Linjiang Artificial Intelligence Machine Learning Social and Information Networks 68T07 I.2.6 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. |
| title | HMSG: Heterogeneous Graph Neural Network based on Metapath Subgraph Learning |
| topic | Artificial Intelligence Machine Learning Social and Information Networks 68T07 I.2.6 |
| url | https://arxiv.org/abs/2109.02868 |