提出关系语义一致的嵌入滤波方法,提升知识图谱表示稳定性。
RSCF: Relation-Semantics Consistent Filter for Entity Embedding of Knowledge Graph
- 共享关系变换矩阵,统一处理所有关系
- 实体变换保留原始嵌入特征,避免信息丢失
- 在多种模型上表现优异,适合高频与低频关系
在知识图谱嵌入中,利用关系特定的实体变换显著提升了性能。然而,变换前后的嵌入一致性未被关注,可能导致嵌入中固有的归纳偏置丢失。问题源于两点:一是关系间的变换表示相互独立,导致相似关系对应不同变换;二是通用插件式方法(如SFBR)通过基于实体的正则化过度集中实体嵌入,使各关系得分分布难以区分。本文提出一种可插拔的知识图谱嵌入方法RSCF,其实体变换具备三个增强语义一致性的特性:1)所有关系共享相同的仿射变换矩阵;2)根式实体变换,将原嵌入加到变换向量上以体现变化;3)对变换进行归一化,防止尺度缩小。为强化一致性带来的语义优势,RSCF还引入关系变换与预测模块。在基于距离和张量分解的补全任务中,RSCF显著优于当前最优方法,在所有关系及其频率下均表现出鲁棒性。
原文摘要 · Abstract (English)
In knowledge graph embedding, leveraging relation specific entity transformation has markedly enhanced performance. However, the consistency of embedding differences before and after transformation remains unaddressed, risking the loss of valuable inductive bias inherent in the embeddings. This inconsistency stems from two problems. First, transformation representations are specified for relations in a disconnected manner, allowing dissimilar transformations and corresponding entity embeddings for similar relations. Second, a generalized plug-in approach as a SFBR (Semantic Filter Based on Relations) disrupts this consistency through excessive concentration of entity embeddings under entity-based regularization, generating indistinguishable score distributions among relations. In this paper, we introduce a plug-in KGE method, Relation-Semantics Consistent Filter (RSCF). Its entity transformation has three features for enhancing semantic consistency: 1) shared affine transformation of relation embeddings across all relations, 2) rooted entity transformation that adds an entity embedding to its change represented by the transformed vector, and 3) normalization of the change to prevent scale reduction. To amplify the advantages of consistency that preserve semantics on embeddings, RSCF adds relation transformation and prediction modules for enhancing the semantics. In knowledge graph completion tasks with distance-based and tensor decomposition models, RSCF significantly outperforms state-of-the-art KGE methods, showing robustness across all relations and their frequencies.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。