When Do LLMs Help With Node Classification? A Comprehensive Analysis
Xixi Wu, Yifei Shen, Fangzhou Ge, Caihua Shan, Yizhu Jiao, Xiangguo Sun, Hong Cheng

TL;DR
This paper systematically compares LLM-based methods for node classification, providing guidelines and a comprehensive testbed to evaluate their performance across various datasets and settings.
Contribution
It introduces LLMNodeBed, a codebase and testbed for node classification with LLMs, and offers extensive experimental insights to guide future research.
Findings
LLM methods outperform traditional ones in semi-supervised settings
Graph Foundation Models outperform open-source LLMs but not GPT-4o in zero-shot
Performance depends on learning paradigms, homophily, and model size
Abstract
Node classification is a fundamental task in graph analysis, with broad applications across various fields. Recent breakthroughs in Large Language Models (LLMs) have enabled LLM-based approaches for this task. Although many studies demonstrate the impressive performance of LLM-based methods, the lack of clear design guidelines may hinder their practical application. In this work, we aim to establish such guidelines through a fair and systematic comparison of these algorithms. As a first step, we developed LLMNodeBed, a comprehensive codebase and testbed for node classification using LLMs. It includes 10 homophilic datasets, 4 heterophilic datasets, 8 LLM-based algorithms, 8 classic baselines, and 3 learning paradigms. Subsequently, we conducted extensive experiments, training and evaluating over 2,700 models, to determine the key settings (e.g., learning paradigms and homophily) and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsAdvanced Algorithms and Applications · Advanced Sensor and Control Systems
