Recently there is an increasing scholarly interest in time-varying knowledge graphs, or temporal knowledge graphs (TKG). Previous research suggests diverse approaches to TKG reasoning that uses historical information. However, less attention has been given to the hierarchies within such information at different timestamps. Given that TKG is a sequence of knowledge graphs based on time, the chronology in the sequence derives hierarchies between the graphs. Furthermore, each knowledge graph has its hierarchical level which may differ from one another. To address these hierarchical characteristics in TKG, we propose HyperVC, which utilizes hyperbolic space that better encodes the hierarchies than Euclidean space. The chronological hierarchies between knowledge graphs at different timestamps are represented by embedding the knowledge graphs as vectors in a common hyperbolic space. Additionally, diverse hierarchical levels of knowledge graphs are represented by adjusting the curvatures of hyperbolic embeddings of their entities and relations. Experiments on four benchmark datasets show substantial improvements, especially on the datasets with higher hierarchical levels.
翻译:最近,对时间变化的知识图或时间知识图(TKG)的学术兴趣日益浓厚。以前的研究表明,对使用历史信息的TKG推理采用不同的方法。然而,在不同的时间戳中,对这些信息中的等级没有多少注意。鉴于TKG是按时间排列的知识图序列,序列中的年表在图表之间产生等级分级。此外,每个知识图的等级层次可能不同。为了应对TKG中的这些等级特征,我们建议使用超标准VC,它使用比Euclidean空间更好的超标准空间来编码等级。在不同的时间戳中,知识图之间的时间顺序结构表现为将知识图作为矢量嵌入共同的超标准空间。此外,通过调整其实体和关系超标准嵌入的曲线,可以代表知识图的不同等级层次。在四个基准数据集上进行的实验显示重大改进,特别是在高等级层次的数据集上。