Mixture of Link Predictors on Graphs

Li Ma, Haoyu Han, Juanhui Li, Harry Shomer, Hui Liu +2 more
2/13/2024
cs.LG

No official code found. Best implementation: ml-ml/Link-MoE (3 stars, last commit 2024-11-14).

Abstract

Link prediction, which aims to forecast unseen connections in graphs, is a fundamental task in graph machine learning. Heuristic methods, leveraging a range of different pairwise measures such as common neighbors and shortest paths, often rival the performance of vanilla Graph Neural Networks (GNNs). Therefore, recent advancements in GNNs for link prediction (GNN4LP) have primarily focused on integrating one or a few types of pairwise information. In this work, we reveal that different node pairs within the same dataset necessitate varied pairwise information for accurate prediction and models that only apply the same pairwise information uniformly could achieve suboptimal performance. As a result, we propose a simple mixture of experts model Link-MoE for link prediction. Link-MoE utilizes various GNNs as experts and strategically selects the appropriate expert for each node pair based on various types of pairwise information. Experimental results across diverse real-world datasets demonstrate substantial performance improvement from Link-MoE. Notably, Link-MoE achieves a relative improvement of 18.71\% on the MRR metric for the Pubmed dataset and 9.59\% on the Hits@100 metric for the ogbl-ppa dataset, compared to the best baselines.

View on arXivView PDF

Code Implementations(1)

ml-ml/Link-MoECommunity100%
31PythonOct 29, 20241 years ago

Similar Papers

Cite this paper

@article{ma2024mixture,
  title  = {Mixture of Link Predictors on Graphs},
  author = {Li Ma and Haoyu Han and Juanhui Li and Harry Shomer and Hui Liu and Xiaofeng Gao and Jiliang Tang},
  year   = {2024},
  eprint = {2402.08583},
  archivePrefix = {arXiv},
  doi    = {10.52202/079017-0511},
  url    = {http://arxiv.org/abs/2402.08583v2},
  journal = {NEURIPS 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2402.08583.svg)](https://codeofpaper.com/paper/2402.08583)

Discussion