atlas

Research map / Graph learning / Graph self-supervised learning

TEG-DB: A Comprehensive Dataset and Benchmark of Textual-Edge Graphs

NeurIPS 2024 · Graph learning › Graph self-supervised learning · approach: LLMs and graph foundation models · 2 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Introduces TEG-DB, a benchmark of nine textual-edge graph datasets (text on both nodes and edges) and benchmarks PLM-, GNN-, entangled-GNN- and LLM-as-predictor methods on link prediction and node classification.

Problem

Existing text-attributed graph datasets put text only on nodes, with edges reduced to binary or categorical attributes, so methods cannot exploit rich textual edge information and experimental settings are inconsistent.

Approach

Provides a unified textual-edge graph format with nine datasets from book, e-commerce, academic and social domains, plus an entangled PLM encoding that embeds node and edge texts jointly before message passing.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Entangle edge text and node text before GPT encoding instead of encoding text directly (ablation)TEG link prediction methods · All evaluated datasetsAUC: about 2%Helped
Entangle edge text and node text before GPT encoding instead of encoding text directly (ablation)TEG node classification methods · All evaluated datasetsMicro-AUC: about 2%Helped
Include edge text instead of using no edge text (ablation)TEG link prediction methods · All evaluated datasetsAUC: at least approximately a 3%Helped
Include edge text instead of using no edge text (ablation)TEG link prediction methods · All evaluated datasetsF1: at least approximately an 8%Helped
Include edge text instead of using no edge text (ablation)TEG node classification methods · All evaluated datasetsMicro-AUC: at least a 3%Helped
Include edge text instead of using no edge text (ablation)TEG node classification methods · All evaluated datasetsMicro-F1: a 6%Helped
Use BERT text embeddings instead of no text embeddings (ablation)TEG link prediction methods · All evaluated datasetsAUC: approximately 5%Helped
Use BERT-Large or GPT-3.5-TURBO text embeddings instead of no text embeddings (ablation)TEG link prediction methods · All evaluated datasetsAUC: about 7%Helped
Use BERT text embeddings instead of no text embeddings (ablation)TEG node classification methods · All evaluated datasetsMicro-AUC: approximately 3%Helped
Use BERT-Large or GPT-3.5-TURBO text embeddings instead of no text embeddings (ablation)TEG node classification methods · All evaluated datasetsMicro-AUC: about 3.5%Helped
Use LLMs as direct predictors rather than PLM-based or GNN-based methodsTEG link prediction · All evaluated datasetsAUC: approximately 10% - 30%Hurt

Surprising findings

Limitations

Experimental setup

Datasets: Goodreads Amazon Reddit Twitter MAG Semantic Scholar Open Data Platform

Benchmarks: TEG-DB Goodreads-Children TEG-DB Goodreads-Crime TEG-DB Amazon-Apps TEG-DB Amazon-Movie TEG-DB Citation TEG-DB Twitter

Metrics: AUC F1 ACC Micro-AUC Micro-F1

Baselines: MLP GraphSAGE GeneralConv GINE EdgeGNN GraphTransformer GPT-3.5-TURBO GPT-4

Builds on: GraphSAGE GINE BERT GraphTransformer

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy