Share your thoughts, 1 month free Claude Pro on usSee more
WorkDL logo mark

MAGNN: Metapath Aggregated Graph Neural Network for Heterogeneous Graph Embedding

About

A large number of real-world graphs or networks are inherently heterogeneous, involving a diversity of node types and relation types. Heterogeneous graph embedding is to embed rich structural and semantic information of a heterogeneous graph into low-dimensional node representations. Existing models usually define multiple metapaths in a heterogeneous graph to capture the composite relations and guide neighbor selection. However, these models either omit node content features, discard intermediate nodes along the metapath, or only consider one metapath. To address these three limitations, we propose a new model named Metapath Aggregated Graph Neural Network (MAGNN) to boost the final performance. Specifically, MAGNN employs three major components, i.e., the node content transformation to encapsulate input node attributes, the intra-metapath aggregation to incorporate intermediate semantic nodes, and the inter-metapath aggregation to combine messages from multiple metapaths. Extensive experiments on three real-world heterogeneous graph datasets for node classification, node clustering, and link prediction show that MAGNN achieves more accurate prediction results than state-of-the-art baselines.

Xinyu Fu, Jiani Zhang, Ziqiao Meng, Irwin King• 2020

Related benchmarks

TaskDatasetResultRank
Node ClassificationIMDB
Macro F1 Score0.5649
201
Node ClassificationACM
Macro F190.88
126
Node ClassificationDBLP
Micro-F193.76
94
Remaining Useful Life predictionC-MAPSS FD002
RMSE13.09
73
Node ClassificationDBLP (test)
Macro-F193.28
70
Node ClassificationIMDB (test)
Macro F1 Score56.49
70
Remaining Useful Life predictionC-MAPSS FD001
RMSE12.63
70
Remaining Useful Life predictionC-MAPSS FD003
RMSE12.15
69
Remaining Useful Life predictionC-MAPSS FD004
RMSE14.3
61
Node ClassificationDBLP HGB (test)
Macro F193.28
27
Showing 10 of 23 rows

Other info

Follow for update