【24h】

Time-aware Link Prediction in RDF Graphs

机译:RDF图中的时间感知链路预测

获取原文

摘要

When a link is not explicitly present in an RDF dataset, it does not mean that the link could not exist in reality. Link prediction methods try to overcome this problem by finding new links in the dataset with support of a background knowledge about the already existing links in the dataset. In dynamic environments that change often and evolve over time, link prediction methods should also take into account the temporal aspects of data. In this paper, we present a novel time-aware link prediction method. We model RDF data as a tensor and take into account the time when RDF data was created. We use an ageing function to model a retention of the information over the time; lower the significance of the older information and promote more recent. Our evaluation shows that the proposed method improves quality of predictions when compared with methods that do not consider the time information.
机译:当一个链接未明确存在于RDF数据集中时,并不意味着该链接无法实际存在。链接预测方法通过在数据集中查找新的链接来支持关于数据集中已存在链接的背景知识来克服此问题。在随着时间的推移而变化的动态环境中,链接预测方法还应考虑数据的时间方面。在本文中,我们提出了一种新的时光链接预测方法。我们将RDF数据塑造为张量,并考虑创建RDF数据的时间。我们使用老化功能来模拟时间内的信息保留;降低旧信息的重要性,促进更新。我们的评价表明,与不考虑时间信息的方法相比,该方法提高了预测的质量。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号