arXiv:2409.00149cs.LGcs.AI2024-09

融合欧氏与双曲空间,提升时序知识图谱推理能力

From Semantics to Hierarchy: A Hybrid Euclidean-Tangent-Hyperbolic Space Model for Temporal Knowledge Graph Reasoning

  • 构建多空间参数模型,分阶段捕捉语义与层级结构
  • 在YAGO数据集上相对误差降低15.0%,显著优于单空间模型
  • 适合处理具有复杂语义与层级关系的时序知识推理任务

时序知识图谱(TKG)推理基于历史数据预测未来事件,但其挑战在于复杂的语义与层级信息。现有欧氏模型擅长捕捉语义,却难以处理层级;而双曲模型虽能有效建模层级,却受限于浅层参数与深层模型缺乏正规化,导致复杂语义表示不足。现有曲率变换方法仍不充分。本文提出一种新型混合几何空间方法,结合欧氏与双曲模型优势。首先在欧氏空间中通过共现与自回归机制捕获复杂语义,并进行归一化;随后通过缩放机制将嵌入转移至切空间,保留语义同时通过查询-候选分离建模重学层级结构;再将其映射至双曲空间。最终,通过可学习的查询特定混合系数,融合双曲与欧氏评分函数,实现对层级与语义的联合归纳偏置。在四个TKG基准上实验表明,本方法在YAGO上的均倒数排名(MRR)相对误差降低达15.0%。可视化分析进一步验证了方法在不同语义与层级复杂度数据集上的自适应能力。

原文摘要 · Abstract (English)

Temporal knowledge graph (TKG) reasoning predicts future events based on historical data, but it's challenging due to the complex semantic and hierarchical information involved. Existing Euclidean models excel at capturing semantics but struggle with hierarchy. Conversely, hyperbolic models manage hierarchical features well but fail to represent complex semantics due to limitations in shallow models' parameters and the absence of proper normalization in deep models relying on the L2 norm. Current solutions, as curvature transformations, are insufficient to address these issues. In this work, a novel hybrid geometric space approach that leverages the strengths of both Euclidean and hyperbolic models is proposed. Our approach transitions from single-space to multi-space parameter modeling, effectively capturing both semantic and hierarchical information. Initially, complex semantics are captured through a fact co-occurrence and autoregressive method with normalizations in Euclidean space. The embeddings are then transformed into Tangent space using a scaling mechanism, preserving semantic information while relearning hierarchical structures through a query-candidate separated modeling approach, which are subsequently transformed into Hyperbolic space. Finally, a hybrid inductive bias for hierarchical and semantic learning is achieved by combining hyperbolic and Euclidean scoring functions through a learnable query-specific mixing coefficient, utilizing embeddings from hyperbolic and Euclidean spaces. Experimental results on four TKG benchmarks demonstrate that our method reduces error relatively by up to 15.0% in mean reciprocal rank on YAGO compared to previous single-space models. Additionally, enriched visualization analysis validates the effectiveness of our approach, showing adaptive capabilities for datasets with varying levels of semantic and hierarchical complexity.

时序知识图谱双曲嵌入多空间建模

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