Link prediction in heterogeneous networks based on multi-graph convolution

Predicting potential links in heterogeneous networks is essential for understanding complex relationships within networks. Previous studies mostly rely on shallow topological information, leading to inaccurate link predictions. To address this, we propose a multi-graph convolution-based method. First, we use Node2vec to learn structural node features, which are then combined with the original node features to form new feature representations. Next, we construct two additional graphs based on cosine similarity and Euclidean distance between nodes. These along with the original graph, undergo dual-channel convolution to learn node representations. The three learned feature matrices are weighted and fused using an attention mechanism, generating the final node features for link prediction. Experiments show significant improvement in prediction performance. Ablation studies and feature visualization further confirm the method’s effectiveness. This approach improves the accuracy of link prediction in heterogeneous networks and enhances understanding of node relationship patterns.

Authors

Institutions

Publication Details

Journal
IET conference proceedings.
Published
2025-01-09
DOI
https://doi.org/10.1049/icp.2024.4304
Citations
1
Primary Topic
Advanced Computing and Algorithms
Type
article
Field-Weighted Citation Impact
6.18
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Link prediction in heterogeneous networks based on multi-graph convolution

Shuang Xu, Honbo Zhou
1 citations
IET conference proceedings.
Advanced Computing and Algorithms
6.18
article

Link prediction in heterogeneous networks based on multi-graph convolution

Shuang Xu, Honbo Zhou
article en
1 citations

Abstract

Predicting potential links in heterogeneous networks is essential for understanding complex relationships within networks. Previous studies mostly rely on shallow topological information, leading to inaccurate link predictions. To address this, we propose a multi-graph convolution-based method. First, we use Node2vec to learn structural node features, which are then combined with the original node features to form new feature representations. Next, we construct two additional graphs based on cosine similarity and Euclidean distance between nodes. These along with the original graph, undergo dual-channel convolution to learn node representations. The three learned feature matrices are weighted and fused using an attention mechanism, generating the final node features for link prediction. Experiments show significant improvement in prediction performance. Ablation studies and feature visualization further confirm the method’s effectiveness. This approach improves the accuracy of link prediction in heterogeneous networks and enhances understanding of node relationship patterns.

IET conference proceedings.Vol. 2024(21)
Dalian Minzu University (CN)
Openalex Percentile: Top 8%
Advanced Computing and Algorithms
6.18
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.

Link prediction in heterogeneous networks based on multi-graph convolution — Shuang Xu, Honbo Zhou · IET conference proceedings. (2025) | TGRS Research Map | TGRS