无需文本信息,跨域异构图学习新框架,提升迁移能力
CrossHGL: A Text-Free Foundation Model for Cross-Domain Heterogeneous Graph Learning
- 通过结构语义转换,将异构图统一为可共享的结构表示
- 在节点和图分类任务上分别提升25.1%和7.6%的准确率
- 适合少样本、无文本标签的跨域图学习场景
异构图表示学习对建模多类型节点与边的复杂系统至关重要。然而,现有方法多局限于共享模式与特征空间的封闭世界设置,限制了跨域泛化能力。尽管近期图基础模型提升了可迁移性,但多数针对同质图,依赖领域特定模式或丰富文本属性。因此,无文本、少样本的跨域异构图学习仍不充分。为此,我们提出CrossHGL,一种无需外部文本监督的基础框架,可保留并传递多关系结构语义。具体地,通过语义保持转换策略,将异构图同质化,并将交互语义编码至边特征。基于此,设计一种提示感知的多域预训练框架,结合三提示机制,从特征、边和结构三视角通过自监督对比学习捕获可迁移知识。针对目标域适配,开发参数高效微调策略,冻结预训练主干,通过提示组合与原型学习实现少样本分类。在节点级与图级任务上的实验表明,CrossHGL持续优于现有最优基线,在节点分类与图分类中分别取得25.1%与7.6%的平均相对提升,且在特征退化挑战场景下仍具竞争力。
原文摘要 · Abstract (English)
Heterogeneous graph representation learning (HGRL) is essential for modeling complex systems with diverse node and edge types. However, most existing methods are limited to closed-world settings with shared schemas and feature spaces, hindering cross-domain generalization. While recent graph foundation models improve transferability, they often target homogeneous graphs, rely on domain-specific schemas, or require rich textual attributes. Consequently, text-free and few-shot cross-domain HGRL remains underexplored. To address this, we propose CrossHGL, a foundation framework that preserves and transfers multi-relational structural semantics without external textual supervision. Specifically, a semantic-preserving transformation strategy homogenizes heterogeneous graphs while encoding interaction semantics into edge features. Based on this, a prompt-aware multi-domain pre-training framework with a Tri-Prompt mechanism captures transferable knowledge across feature, edge, and structure perspectives via self-supervised contrastive learning. For target-domain adaptation, we develop a parameter-efficient fine-tuning strategy that freezes the pre-trained backbone and performs few-shot classification via prompt composition and prototypical learning. Experiments on node-level and graph-level tasks show that CrossHGL consistently outperforms state-of-the-art baselines, yielding average relative improvements of 25.1% and 7.6% in Micro-F1 for node and graph classification, respectively, while remaining competitive in challenging feature-degenerated settings.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。