用本体构建图注意力网络,提升复杂图的表征学习效果。
Perturbation Ontology based Graph Attention Networks
- 引入本体作为语义基础,融合结构与语义信息
- 自监督训练生成强负样本,提升链接预测和节点分类性能
- 适合需要深度上下文理解的异构图应用
近年来,图表示学习经历了范式转变,主要由图神经网络(GNN)及其异构变体的兴起推动。异构GNN在从包含多种实体类型和关系的复杂图中提取低维嵌入方面表现出色。尽管基于元路径的技术长期被认可为捕捉节点间语义关联的有效手段,但其依赖人工指定存在显著局限。相比之下,以矩阵为中心的方法利用结构线索加速处理,却常忽略上下文丰富性。本文挑战现有范式,提出将本体作为复杂图中的基本语义单元。我们设计了扰动本体图注意力网络(POGAT),通过结合本体子图与先进的自监督学习框架,实现深层上下文理解。核心创新在于改进的同质扰动机制,可生成严格的负样本,促使模型更深入探索最小上下文特征。大量实证评估表明,POGAT显著优于当前主流基线,在链接预测任务上F1-score最高提升10.78%,在节点分类任务上Micro-F1提升12.01%。
原文摘要 · Abstract (English)
In recent years, graph representation learning has undergone a paradigm shift, driven by the emergence and proliferation of graph neural networks (GNNs) and their heterogeneous counterparts. Heterogeneous GNNs have shown remarkable success in extracting low-dimensional embeddings from complex graphs that encompass diverse entity types and relationships. While meta-path-based techniques have long been recognized for their ability to capture semantic affinities among nodes, their dependence on manual specification poses a significant limitation. In contrast, matrix-focused methods accelerate processing by utilizing structural cues but often overlook contextual richness. In this paper, we challenge the current paradigm by introducing ontology as a fundamental semantic primitive within complex graphs. Our goal is to integrate the strengths of both matrix-centric and meta-path-based approaches into a unified framework. We propose perturbation Ontology-based Graph Attention Networks (POGAT), a novel methodology that combines ontology subgraphs with an advanced self-supervised learning paradigm to achieve a deep contextual understanding. The core innovation of POGAT lies in our enhanced homogeneous perturbing scheme designed to generate rigorous negative samples, encouraging the model to explore minimal contextual features more thoroughly. Through extensive empirical evaluations, we demonstrate that POGAT significantly outperforms state-of-the-art baselines, achieving a groundbreaking improvement of up to 10.78\% in F1-score for the critical task of link prediction and 12.01\% in Micro-F1 for the critical task of node classification.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。