• Medientyp: E-Artikel
  • Titel: ELPKG: A High-Accuracy Link Prediction Approach for Knowledge Graph Completion
  • Beteiligte: Ma, Jiangtao; Qiao, Yaqiong; Hu, Guangwu; Wang, Yanjun; Zhang, Chaoqin; Huang, Yongzhong; Sangaiah, Arun Kumar; Wu, Huaiguang; Zhang, Hongpo; Ren, Kai
  • Erschienen: MDPI AG, 2019
  • Erschienen in: Symmetry
  • Sprache: Englisch
  • DOI: 10.3390/sym11091096
  • ISSN: 2073-8994
  • Schlagwörter: Physics and Astronomy (miscellaneous) ; General Mathematics ; Chemistry (miscellaneous) ; Computer Science (miscellaneous)
  • Entstehung:
  • Anmerkungen:
  • Beschreibung: <jats:p>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.</jats:p>
  • Zugangsstatus: Freier Zugang