Large Language Models Meet Graph Neural Networks: A Perspective of Graph Mining

Yuxin You, Zhen Liu, Xiangchao Wen, Yongtao Zhang, Wei Ai

Main figure for Large Language Models Meet Graph Neural Networks: A Perspective of Graph Mining

Abstract

Graph mining is an important area in data mining and machine learning that involves extracting valuable information from graph-structured data. In recent years, significant progress has been made in this field through the development of graph neural networks (GNNs). However, GNNs are still deficient in generalizing to diverse graph data. Aiming to this issue, Large Language Models (LLMs) could provide new solutions for graph mining tasks with their superior semantic understanding. In this review, we systematically review the combination and application techniques of LLMs and GNNs and present a novel taxonomy for research in this interdisciplinary field, which involves three main categories: GNN-driving-LLM, LLM-driving-GNN, and GNN-LLM-co-driving. Within this framework, we reveal the capabilities of LLMs in enhancing graph feature extraction as well as improving the effectiveness of downstream tasks such as node classification, link prediction, and community detection. Although LLMs have demonstrated their great potential in handling graph-structured data, their high computational requirements and complexity remain challenges. Future research needs to continue to explore how to efficiently fuse LLMs and GNNs to achieve more powerful graph learning and reasoning capabilities and provide new impetus for the development of graph mining techniques.

Benchmark Results

Tested on 1 dataset

Tables show presented results in global context (best 3 papers + GCN + MLP).

Classic

Amazon-Photo

Global leaderboard →

Default metric is Accuracy. The paper reports 1 value on Accuracy and 1 value on Recall .

#ModelAccuracy ↑ defaultRecall ↑Paper
1
GraphTARIF
0.9703 ± 0.0019
—
2
GAT
0.9669 ± 0.0014
—
3
GAT+T
0.9660 ± 0.0007
—
7
SAGE
0.9643 ± 0.0027
—
390
MLP
0.9128 ± 0.0063
—
534
PATTON
0.7860 ±0.0015
0.7860 ± 0.0015
Recall 0.7860 ± 0.0015
paper 0.7860 ±0.0015
paper 0.7860 ±0.0015 Δ at pub 0.0262
SOTA performance (not significantly different from the best) Global context (other papers) Best at pub — reported value improved over the best known when published