Text-attributed Graph Condensation via Text Selection and Attribute Matching

• URL: http://arxiv.org/abs/2606.03839v1
• Date: Tue, 02 Jun 2026 16:20:02 GMT
• Title: Text-attributed Graph Condensation via Text Selection and Attribute Matching
• Abstract summary: Text-Attributed Graph (TAG) is an important type of graph structured data, where each node has a text description.<n>We propose TAGSAM, a condensation method that compresses TAGs while preserving training accuracy.<n>We evaluate TAGSAM against six state-of-the-art baselines, where it showcases superior performance.
• Score: 28.931532502324487
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Text-Attributed Graph (TAG) is an important type of graph structured data, where each node has a text description. TAG models usually train a Graph Neural Network (GNN) and language model jointly, which leads to high space and time consumption, especially on large datasets. To mitigate this, we propose TAGSAM, a condensation method that compresses TAGs while preserving training accuracy. TAGSAM comes with two key designs, i.e., subgraph text Selection and Attribute similarity Matching, which compress the text description and graph topology of TAG, respectively. For the texts, subgraph text selection selects and merges representative text chunks from multiple related text descriptions by maximizing mutual information. For the graph topology, popular condensation methods based on Matching Training Trajectories (MTT) suffer from high variance, which hinders accuracy. Our attribute similarity matching mitigates this issue by aligning stable similarity matrices. We evaluate TAGSAM against six state-of-the-art baselines, where it showcases superior performance. For the same compressed size, TAGSAM improves upon the best-performing baseline by an average of 4.9% in accuracy. Furthermore, it maintains competitive training accuracy even when the TAG is condensed to just 1% size. Our code is available at https://github.com/SundayVHan/TAGSAM

Related papers

• Exploiting Text Semantics for Few and Zero Shot Node Classification on Text-attributed Graph [45.61861034952655]
  Text-attributed graph (TAG) provides a text description for each graph node.<n>We propose Text Semantics Augmentation (TSA) to improve accuracy by introducing more text semantic supervision signals.
  arXiv  Detail & Related papers  (2025-05-13T02:06:08Z)
• EAFormer: Scene Text Segmentation with Edge-Aware Transformers [56.15069996649572]
  Scene text segmentation aims at cropping texts from scene images, which is usually used to help generative models edit or remove texts. We propose Edge-Aware Transformers, EAFormer, to segment texts more accurately, especially at the edge of texts.
  arXiv  Detail & Related papers  (2024-07-24T06:00:33Z)
• Pre-Training and Prompting for Few-Shot Node Classification on Text-Attributed Graphs [35.44563283531432]
  Text-attributed graph (TAG) is one kind of important real-world graph-structured data with each node associated with raw texts. For TAGs, traditional few-shot node classification methods directly conduct training on the pre-processed node features. We propose P2TAG, a framework designed for few-shot node classification on TAGs with graph pre-training and prompting.
  arXiv  Detail & Related papers  (2024-07-22T07:24:21Z)
• TAGLAS: An atlas of text-attributed graph datasets in the era of large graph and language models [25.16561980988102]
  TAGLAS is an atlas of text-attributed graph (TAG) datasets and benchmarks. We collect and integrate more than 23 TAG datasets with domains ranging from citation graphs to molecule graphs. We provide a standardized, efficient, and simplified way to load all datasets and tasks.
  arXiv  Detail & Related papers  (2024-06-20T19:11:35Z)
• Learning Multiplex Representations on Text-Attributed Graphs with One Language Model Encoder [55.24276913049635]
  We propose METAG, a new framework for learning Multiplex rEpresentations on Text-Attributed Graphs. In contrast to existing methods, METAG uses one text encoder to model the shared knowledge across relations. We conduct experiments on nine downstream tasks in five graphs from both academic and e-commerce domains.
  arXiv  Detail & Related papers  (2023-10-10T14:59:22Z)
• Copy Is All You Need [66.00852205068327]
  We formulate text generation as progressively copying text segments from an existing text collection. Our approach achieves better generation quality according to both automatic and human evaluations. Our approach attains additional performance gains by simply scaling up to larger text collections.
  arXiv  Detail & Related papers  (2023-07-13T05:03:26Z)
• ConGraT: Self-Supervised Contrastive Pretraining for Joint Graph and Text Embeddings [20.25180279903009]
  We propose Contrastive Graph-Text pretraining (ConGraT) for jointly learning separate representations of texts and nodes in a text-attributed graph (TAG) Our method trains a language model (LM) and a graph neural network (GNN) to align their representations in a common latent space using a batch-wise contrastive learning objective inspired by CLIP. Experiments demonstrate that ConGraT outperforms baselines on various downstream tasks, including node and text category classification, link prediction, and language modeling.
  arXiv  Detail & Related papers  (2023-05-23T17:53:30Z)
• Hierarchical Heterogeneous Graph Representation Learning for Short Text Classification [60.233529926965836]
  We propose a new method called SHINE, which is based on graph neural network (GNN) for short text classification. First, we model the short text dataset as a hierarchical heterogeneous graph consisting of word-level component graphs. Then, we dynamically learn a short document graph that facilitates effective label propagation among similar short texts.
  arXiv  Detail & Related papers  (2021-10-30T05:33:05Z)
• Graph Structured Network for Image-Text Matching [127.68148793548116]
  We present a novel Graph Structured Matching Network to learn fine-grained correspondence. The GSMN explicitly models object, relation and attribute as a structured phrase. Experiments show that GSMN outperforms state-of-the-art methods on benchmarks.
  arXiv  Detail & Related papers  (2020-04-01T08:20:42Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.