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

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
Jul 2026

Cross-Resolution Semantic Learning for Graph Domain Adaptation

Cross-Resolution Semantic Learning (CReSL), a GDA method that learns soft sourceto-target resolution correspondence from cross-domain class structure, and introduces Cross-Resolution Prototype Transport, which constructs class-resolution prototypes from source labels and soft target posteriors and converts cross-domain...

Yingxu Wang, Haoze Huang, Zhongkai Zheng et al. · 1 citation
Open access 2025

Graph Foundation Models for Cross-Domain Knowledge Integration and Analytics

The proposed framework provides a scalable foundation for graph-based artificial intelligence and has applications in biomedical knowledge discovery, financial fraud detection, industrial digital twins, recommendation systems, cybersecurity intelligence, scientific literature mining, and smart governance.

Seppo Linnainmaa, A. Salomaa · 0 citations
Jul 2026

Beyond Feature and Structure Alignment: Learning Transferable Propagation Knowledge for Graph Foundation Models

A Propagation-aware Graph Foundation Model (ProGFM), which regards the propagation relationships between edges and feature dimensions as transferable knowledge units, and exhibits superior generalization performance compared with existing methods.

Yi Wang, Jitao Zhao, Di Jin 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 Aug 2026

FITTER: Vocabulary-Agnostic Cross-Domain Inference on Temporal Knowledge Graphs

FITTER consistently outperforms inductive baselines without retraining, indicating that vocabulary-agnostic structural learning is a viable foundation for inference over the heterogeneous knowledge graphs of the Semantic Web.

Jia-Xin Pan, M. Nayyeri, Osama Mohammed 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.