MoHGNN: Enhanced Heterogeneous Graph Neural Network via Metapath Optimization

In this paper, we propose a novel heterogeneous graph neural networks (HGNNs) model that addresses two major limitations of existing metapath-based methods: (1) Defining suitable metapaths requires professional knowledge in the special domain. (2) The neighbor nodes of the target node also play crucial roles for embedding, but common methods often overlook this factor. Specifically, our model optimizes metapath selection by evaluating all potential metapaths through edge-based PageRank. Then, through aggregation of intra- and intermetapaths obtain metapath embeddings. Next, we gather neighboring nodes that are highly correlated with the target node and obtain the embeddings of node type to optimize metapath embeddings for the next step. Finally, we employ a two-layer attention architecture to acquire the embedding of target node. The experiments on three real-world datasets demonstrate that our method outperforms state-of-the-art methods in handling downstream tasks such as node classification and clustering.

Authors

Institutions

Publication Details

Published
2025-03-12
DOI
https://doi.org/10.1109/icassp49660.2025.10889491
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

MoHGNN: Enhanced Heterogeneous Graph Neural Network via Metapath Optimization

Tong Zhang, Yuxin Zhang, Qingyun Liu, Xingyu Fu
Advanced Graph Neural Networks
article

MoHGNN: Enhanced Heterogeneous Graph Neural Network via Metapath Optimization

Tong Zhang, Yuxin Zhang, Qingyun Liu, Xingyu Fu
article en

Abstract

In this paper, we propose a novel heterogeneous graph neural networks (HGNNs) model that addresses two major limitations of existing metapath-based methods: (1) Defining suitable metapaths requires professional knowledge in the special domain. (2) The neighbor nodes of the target node also play crucial roles for embedding, but common methods often overlook this factor. Specifically, our model optimizes metapath selection by evaluating all potential metapaths through edge-based PageRank. Then, through aggregation of intra- and intermetapaths obtain metapath embeddings. Next, we gather neighboring nodes that are highly correlated with the target node and obtain the embeddings of node type to optimize metapath embeddings for the next step. Finally, we employ a two-layer attention architecture to acquire the embedding of target node. The experiments on three real-world datasets demonstrate that our method outperforms state-of-the-art methods in handling downstream tasks such as node classification and clustering.

Chinese Academy of Sciences (CN), Institute of Information Engineering (CN)
Openalex Percentile: Top 98%
Advanced Graph Neural Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.