Democratizing Large Language Model-Based Graph Data Augmentation via Latent Knowledge Graphs
Yushi Feng, Tsai Hor Chan, Guosheng Yin, Lequan Yu
TL;DR
The paper tackles data scarcity and noise in graph representation learning and the barrier posed by white-box LLM augmenters. It introduces DemoGraph, a black-box, context-driven graph data augmenter that constructs latent knowledge graphs from prompts and dynamically merges them into the training graph, with granularity-aware prompting and instruction fine-tuning to manage sparsity. Empirical results across generic benchmarks, large-scale graphs, and electronic health records demonstrate superior performance and improved interpretability, validating the method's robustness and scalability. The approach broadens the use of open-world domain knowledge in graph learning and offers a practical, democratized framework for LLM–assisted data augmentation with broad potential applications beyond healthcare.
Abstract
Data augmentation is necessary for graph representation learning due to the scarcity and noise present in graph data. Most of the existing augmentation methods overlook the context information inherited from the dataset as they rely solely on the graph structure for augmentation. Despite the success of some large language model-based (LLM) graph learning methods, they are mostly white-box which require access to the weights or latent features from the open-access LLMs, making them difficult to be democratized for everyone as existing LLMs are mostly closed-source for commercial considerations. To overcome these limitations, we propose a black-box context-driven graph data augmentation approach, with the guidance of LLMs -- DemoGraph. Leveraging the text prompt as context-related information, we task the LLM with generating knowledge graphs (KGs), which allow us to capture the structural interactions from the text outputs. We then design a dynamic merging schema to stochastically integrate the LLM-generated KGs into the original graph during training. To control the sparsity of the augmented graph, we further devise a granularity-aware prompting strategy and an instruction fine-tuning module, which seamlessly generates text prompts according to different granularity levels of the dataset. Extensive experiments on various graph learning tasks validate the effectiveness of our method over existing graph data augmentation methods. Notably, our approach excels in scenarios involving electronic health records (EHRs), which validates its maximal utilization of contextual knowledge, leading to enhanced predictive performance and interpretability.
