DSKG: A deep sequential model for knowledge graph completion

19Citations
Citations of this article
60Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Knowledge graph (KG) completion aims to fill the missing facts in a KG, where a fact is represented as a triple in the form of (subject, relation, object). Current KG completion models compel two-thirds of a triple provided (e.g., subject and relation) to predict the remaining one. In this paper, we propose a new model, which uses a KG-specific multi-layer recurrent neutral network (RNN) to model triples in a KG as sequences. It outperformed several state-of-the-art KG completion models on the conventional entity prediction task for many evaluation metrics, based on two benchmark datasets and a more difficult dataset. Furthermore, our model is enabled by the sequential characteristic and thus capable of predicting the whole triples only given one entity. Our experiments demonstrated that our model achieved promising performance on this new triple prediction task.

Cite

CITATION STYLE

APA

Guo, L., Zhang, Q., Ge, W., Hu, W., & Qu, Y. (2019). DSKG: A deep sequential model for knowledge graph completion. In Communications in Computer and Information Science (Vol. 957, pp. 65–77). Springer Verlag. https://doi.org/10.1007/978-981-13-3146-6_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free