Skip to content
Book Open access

Collaborative Knowledge Extraction and Integration for Graph Domain Incremental Learning

Aug 2026 · Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2 · pp. 2603-2614 · 0 citations · 26 references

TL;DR

This work proposes COllabOrative Knowledge Extraction and integRation (COOKER) method for GDIL to mine inter-domain relationships and uncover the potential of domain-agnostic representations, which significantly outperforms existing baselines.

Abstract

Graph Domain Incremental Learning (GDIL) aims to acquire knowledge from a continuous stream of graph domains while mitigating catastrophic forgetting. While parameter-isolation methods leveraging graph parameter-efficient adaptation show promise, prompt-based techniques struggle to adapt to GDIL, and low-rank adaptation methods based on a shared classification layer lead to knowledge confusion.Our empirical observations reveal that transferable knowledge is primarily concentrated in the representation layer. Further, we argue that domain-agnostic representations that are not tied to the classification characteristics are needed to assist the new model in capturing more discriminative features for graph domain incremental learning.Motivated by these insights, we propose COllabOrative Knowledge Extraction and integRation (COOKER) method for GDIL to mine inter-domain relationships and uncover the potential of domain-agnostic representations. Specifically, COOKER employs domain-specific LoRA modules and classifiers to capture specific knowledge. A domain-agnostic LoRA module is instantiated to extract transferable knowledge through contrastive acquisition and topology alignment. We introduce collaborative dynamic integration of dual representations to enable adaptive integration, guided by a complementarity loss to eliminate information redundancy. Extensive experiments demonstrate that COOKER significantly outperforms existing baselines, achieving up to a 4.7% improvement in average performance.

Read PDF

Similar papers

Conference Open access Sep 2026

LLMs as Parametric Knowledge Sources for Knowledge Graph Completion

This framework performs LLM knowledge elicitation to extract factual knowledge from the model’s internal representations and transforms sentence-level representations into entity-level representations and aligns them within a unified space.

Deyu Chen, Qi-Yuan Li, Jinguang Gu et al. · 0 citations
#machine learning Preprint Sep 2026

Graph Domain Adaptation Does Not End with Representation Learning

EviGDA is proposed, an Evidence-Augmented Graph Domain Adaptation framework that complements graph representation adaptation with a graph-free local expert, and shows that EviGDA outperforms state-of-the-art baselines.

Zi-Qian Liu, Yong-Xue Xu, En-Ze Zhang et al. · 0 citations
Open access Aug 2026

Towards explainable knowledge tracing through meta-path-free heterogeneous graph learning with large language models

HG-KT (Meta-path-free Heterogeneous Graph Knowledge Tracing), an explainable framework that integrates a meta-path-free heterogeneous graph encoder, Transformer-based temporal modeling, and pretrained Llama 3 8B semantic embeddings through a joint cross-modal attention mechanism, is proposed.

Olaniyan Deborah, Wario Ruth · 1 citation
Preprint Sep 2026

SUCRe: Selective Uncertainty-Aware Contrastive Representation for Graph Transfer Learning

This work introduces structure-aware entropy-based matching discrepancy, which jointly models feature uncertainty and structural coherence to ensure accurate feature adaptation between graphs and develops a domain-aware semi-hard negative sampling strategy that constructs informative contrastive sets by filtering unrel...

Ming-Can Wang, Jun-Chang Xin, Zhong-Ming Yao et al. · 0 citations
Sep 2026

KD-GAG: Knowledge-distilled graph-augmented generation via preference-aware subgraph pruning.

A novel framework KD-GAG is proposed that efficiently constructs KGs by distilling teacher LLMs' semantics and reasoning into a smaller student LLM and a preference-based subgraph pruning method to optimize the retrieval process.

Long Zhao, Yin Xu, Yan-Yan Wang et al. · 0 citations
#machine learning Preprint Oct 2026

MAGIC: Topology-Aware Analytic Graph Few-Shot Class-Incremental Learning

Graph few-shot class-incremental learning (GFSCIL) requires a model to continually recognize emerging classes from only a few labeled nodes while preserving previously acquired knowledge. Beyond the catastrophic forgetting inherited from conventional graph continual learning, GFSCIL presents two distinctive challenges:...

Jun-Lin Chen, Yu-Han Wang, Xue-Fei Wang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.