arXiv:2602.04244cs.LG2026-02

无需语言模型,统一跨域图表示,提升少样本图分类效果

GraphVec: Cross-Domain Graph Vectorization for Graph-Level Representation Learning

  • 构建多尺度全局图提取谱特征,实现跨数据集可比的关联信息
  • 在13个数据集上少样本图分类优于主流基线,准确率提升显著
  • 适合需要跨域图表示的科研与工业场景,尤其少标注任务

学习跨异构域的通用图表示极具挑战,因图数据在拓扑结构、节点属性语义、特征维度甚至属性可用性上差异巨大。我们提出GraphVec,一种无需语言模型的图向量化模型,将多样图映射为可迁移的固定维度嵌入,用于图级任务。不同于直接使用不可比的原始节点属性,GraphVec在每个数据集的所有节点上构建多尺度全局图,并提取谱嵌入以获得领域无关的关系特征。为使这些谱特征在不同数据集间可比,我们引入基于正交变换的密度最大化均值对齐算法,并证明其单调收敛性。GraphVec进一步结合GIN-图注意力网络骨干与多层参考分布模块,保留了超越标准池化的节点级分布信息。我们还给出了所提模型的泛化误差界。在超过15种对比方法、13个数据集上的实验表明,GraphVec在跨域少样本图分类和图聚类任务中持续优于强基线。此外,该模型在节点级任务中也表现优异,在少样本节点分类上达到与代表性图提示学习方法相当的性能。

原文摘要 · Abstract (English)

Learning universal graph representations across heterogeneous domains is difficult because graph datasets differ in topology, node-attribute semantics, feature dimensions, and even attribute availability. We propose GraphVec, a language-model-free graph vectorization model that maps diverse graphs into transferable fixed-dimensional embeddings for graph-level tasks. Instead of directly using incomparable raw node attributes, GraphVec constructs multi-scale global graphs over all nodes in each dataset and extracts spectral embeddings to obtain domain-agnostic relational features. To make these spectral features comparable across datasets, we introduce a density-maximization mean alignment algorithm over orthogonal transformations and prove its monotonic convergence. GraphVec further combines a GIN--Graph Transformer backbone with a multi-layer reference distribution module, which preserves node-level distributional information beyond standard pooling. We also provide a generalization error bound for the proposed model. Experiments on 13 datasets with more than 15 comparison methods demonstrate that GraphVec consistently outperforms strong graph pretraining baselines in cross-domain few-shot graph classification and graph clustering. Beyond graph-level tasks, GraphVec also yields strong node-level representations, achieving competitive performance on few-shot node classification against representative graph prompt learning methods.

图表示学习跨域迁移少样本学习谱特征

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。