Can LLMs Convert Graphs to Text-Attributed Graphs?

Zehong Wang, Sidney Liu, Zheyuan Zhang, Tianyi Ma, Chuxu Zhang +1 more
12/13/2024
cs.CLcs.AIcs.LG

Official code: Zehong-Wang/TANS (16 stars, MIT, last commit 2025-03-07).

Abstract

Graphs are ubiquitous structures found in numerous real-world applications, such as drug discovery, recommender systems, and social network analysis. To model graph-structured data, graph neural networks (GNNs) have become a popular tool. However, existing GNN architectures encounter challenges in cross-graph learning where multiple graphs have different feature spaces. To address this, recent approaches introduce text-attributed graphs (TAGs), where each node is associated with a textual description, which can be projected into a unified feature space using textual encoders. While promising, this method relies heavily on the availability of text-attributed graph data, which is difficult to obtain in practice. To bridge this gap, we propose a novel method named Topology-Aware Node description Synthesis (TANS), leveraging large language models (LLMs) to convert existing graphs into text-attributed graphs. The key idea is to integrate topological information into LLMs to explain how graph topology influences node semantics. We evaluate our TANS on text-rich, text-limited, and text-free graphs, demonstrating its applicability. Notably, on text-free graphs, our method significantly outperforms existing approaches that manually design node features, showcasing the potential of LLMs for preprocessing graph-structured data in the absence of textual information. The code and data are available at https://github.com/Zehong-Wang/TANS.

View on arXivView PDF

Code Implementations(1)

Zehong-Wang/TANSOfficial100%
MIT

Can LLMs Convert Graphs to Text-Attributed Graphs? NAACL 25

163Shell, PythonDec 13, 20241 years agoMIT
gnnllm

Similar Papers

Cite this paper

@article{wang2024llms,
  title  = {Can LLMs Convert Graphs to Text-Attributed Graphs?},
  author = {Zehong Wang and Sidney Liu and Zheyuan Zhang and Tianyi Ma and Chuxu Zhang and Yanfang Ye},
  year   = {2024},
  eprint = {2412.10136},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2412.10136v2}
}

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/2412.10136.svg)](https://codeofpaper.com/paper/2412.10136)

Discussion