Next Article in Journal
Two Parametric Kinds of Eulerian-Type Polynomials Associated with Euler’s Formula
Next Article in Special Issue
Investigation of Fusion Features for Apple Classification in Smart Manufacturing
Previous Article in Journal
An Adaptive Routing-Forwarding Control Scheme Based on an Intelligent Fuzzy Decision-Making System for Opportunistic Social Networks
Previous Article in Special Issue
Symmetry Encoder-Decoder Network with Attention Mechanism for Fast Video Object Segmentation
Open AccessArticle

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

1
School of Computer and Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou 450002, China
2
National Digital Switching System Engineering & Technological R&D Center, Zhengzhou 450002, China
3
State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou 450001, China
4
School of Computer Science, Shenzhen Institute of Information Technology, Shenzhen 518172, China
5
School of Computer Science and Information Security, Guilin University of Electronic Technology, Guilin 541004, China
6
School of Computer Science and Engineering, VIT University, Vellore 632014, India
7
Cooperative Innovation Center of Internet Healthcare, Zhengzhou University, Zhengzhou 450000, China
*
Author to whom correspondence should be addressed.
Symmetry 2019, 11(9), 1096; https://doi.org/10.3390/sym11091096
Received: 31 July 2019 / Revised: 25 August 2019 / Accepted: 27 August 2019 / Published: 2 September 2019
(This article belongs to the Special Issue Novel Machine Learning Approaches for Intelligent Big Data 2019)
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 [email protected], [email protected], and MRR. View Full-Text
Keywords: relation completion; knowledge graph completion; link prediction; probabilistic soft logic relation completion; knowledge graph completion; link prediction; probabilistic soft logic
Show Figures

Figure 1

MDPI and ACS Style

Ma, J.; Qiao, Y.; Hu, G.; Wang, Y.; Zhang, C.; Huang, Y.; Sangaiah, A.K.; Wu, H.; Zhang, H.; Ren, K. ELPKG: A High-Accuracy Link Prediction Approach for Knowledge Graph Completion. Symmetry 2019, 11, 1096.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Search more from Scilit
 
Search
Back to TopTop