首页> 外文OA文献 >ELPKG: A High-Accuracy Link Prediction Approach for Knowledge Graph Completion
【2h】

ELPKG: A High-Accuracy Link Prediction Approach for Knowledge Graph Completion

机译:ELPKG:知识图表完成的高精度链接预测方法

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Link prediction in knowledge graph is the task of utilizing the existing relations to infer new relations so as to build a more complete knowledge graph. The inferred new relations plus original knowledge graph is the symmetry of completion knowledge graph. Previous research on link predication only focuses on path or semantic-based features, which can hardly have a full insight of features between entities and may result in a certain ratio of false inference results. To improve the accuracy of link predication, we propose a novel approach named Entity Link Prediction for Knowledge Graph (ELPKG), which can achieve a high accuracy on large-scale knowledge graphs while keeping desirable efficiency. ELPKG first combines path and semantic-based features together to represent the relationships between entities. Then it adopts a probabilistic soft logic-based reasoning method that effectively solves the problem of non-deterministic knowledge reasoning. Finally, the relation between entities is completed based on the entity link prediction algorithm. Extensive experiments on real dataset show that ELPKG outperforms baseline methods on hits@1, hits@10, and MRR.
机译:知识图中的链路预测是利用现有关系推断新关系的任务,以便构建更完整的知识图形。推断的新关系加上原始知识图是完成知识图的对称性。以前关于链路预测的研究仅侧重于路径或基于语义的特征,这几乎不能完全识别实体之间的功能,并且可能导致虚假推断结果的一定比率。为了提高链路预测的准确性,我们提出了一种名为实体链路预测的新方法,用于知识图(ELPKG),其可以在保持所需效率的同时在大规模知识图上实现高精度。 ELPKG首先将路径和基于语义的特征组合在一起,以表示实体之间的关系。然后,它采用了一种基于概率的软逻辑的推理方法,有效解决了非确定性知识推理的问题。最后,基于实体链路预测算法完成实体之间的关系。关于Real DataSet的广泛实验表明ELPKG优于HITS @ 1,HITS @ 10和MRR的基线方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号