GDL4LLM pre-trains LLMs to predict random-walk sequences of node tokens, then fine-tunes on those sequences for node classification, outperforming description- and embedding-based baselines.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CL 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Each Graph is a New Language: Graph Learning with LLMs
GDL4LLM pre-trains LLMs to predict random-walk sequences of node tokens, then fine-tunes on those sequences for node classification, outperforming description- and embedding-based baselines.