Mixture of Link Predictors on Graphs

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Ma, Li, Han, Haoyu, Li, Juanhui, Shomer, Harry, Liu, Hui, Gao, Xiaofeng, Tang, Jiliang
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866929652701855744
author Ma, Li
Han, Haoyu
Li, Juanhui
Shomer, Harry
Liu, Hui
Gao, Xiaofeng
Tang, Jiliang
author_facet Ma, Li
Han, Haoyu
Li, Juanhui
Shomer, Harry
Liu, Hui
Gao, Xiaofeng
Tang, Jiliang
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2402_08583
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Mixture of Link Predictors on Graphs
Ma, Li
Han, Haoyu
Li, Juanhui
Shomer, Harry
Liu, Hui
Gao, Xiaofeng
Tang, Jiliang
Machine Learning
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.
title Mixture of Link Predictors on Graphs
topic Machine Learning
url https://arxiv.org/abs/2402.08583