Name
Abstract | ||
|---|---|---|
Knowledge graph embedding aims to represent structured entities and relations as continuous and dense low-dimensional vectors. With more and more embedding models being proposed, it has been widely used in many tasks such as semantic search, knowledge graph completion and intelligent question and answer. Most knowledge graph embedding models focus on how to get information about different entities and relations. However, the generalization of knowledge graph embedding or the link prediction ability is not well-studied empirically and theoretically. The study of generalization ability is conducive to further improving the performance of the model. In this paper, we propose two measures to quantify the generalization ability of knowledge graph embedding and use them to analyze the performance of translation-based models. Extensive experimental results show that our measures can well evaluate the generalization ability of a knowledge graph embedding model. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/978-3-030-41407-8_11 | JIST |
Field | DocType | Citations |
Knowledge graph,Embedding,Semantic search,Computer science,Theoretical computer science | Conference | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Liang Zhang | 1 | 0 | 0.34 |
| Huan Gao | 2 | 0 | 0.34 |
| Xianda Zheng | 3 | 0 | 0.34 |
| Guilin Qi | 4 | 961 | 88.58 |
| Jiming Liu | 5 | 0 | 0.34 |