Abstract

To address the problem of sparse relationships between entities in the current knowledge graph and the increase in complexity and computational effort in knowledge inference, this paper proposes a knowledge inference method based on a multi-headed attention mechanism - the MAtt-BiGRU model. For a given triad, the path information is encoded by a two-way gated recurrent neural network, and the confidence of the model is calculated by aggregating it with the candidate paths with the help of the multi-headed attention mechanism, while the inference ability of the model is enhanced by dynamic negative sample training. Numerical experiments are conducted on the MAtt-BiGRU model using large knowledge graph datasets NELL-995 and FB15k-237. The experimental results show that the proposed MAtt-BiGRU model has better results in Mean Average Precision (MAP) and Mean Reciprocal Rank(MRR) performance evaluation metrics when compared with existing commonly used path ranking algorithms such as Path Ranking Algorithm(PRA) and Path-RNN, and the proposed model can more accurately reason about the relations between entities.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.