Modeling Relation Paths for Representation Learning of Knowledge Bases
About
Representation learning of knowledge bases (KBs) aims to embed both entities and relations into a low-dimensional space. Most existing methods only consider direct relations in representation learning. We argue that multiple-step relation paths also contain rich inference patterns between entities, and propose a path-based representation learning model. This model considers relation paths as translations between entities for representation learning, and addresses two key challenges: (1) Since not all relation paths are reliable, we design a path-constraint resource allocation algorithm to measure the reliability of relation paths. (2) We represent relation paths via semantic composition of relation embeddings. Experimental results on real-world datasets show that, as compared with baselines, our model achieves significant and consistent improvements on knowledge base completion and relation extraction from text.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Link Prediction | FB15k-237 (test) | Hits@1047.4 | 419 | |
| Link Prediction | WN18RR (test) | Hits@1050.5 | 380 | |
| Link Prediction | FB15K (test) | Hits@100.855 | 164 | |
| Link Prediction | FB15k | Hits@1084.6 | 90 | |
| Link Prediction | WN18 | Hits@1094.2 | 77 | |
| Triple classification | WN11 (test) | Accuracy75.9 | 55 | |
| Triple classification | FB13 (test) | Accuracy81.5 | 55 | |
| Knowledge Graph Completion | FB15K (test) | Hits@10 (Filtered)84.6 | 41 | |
| Link Prediction | UMLS (test) | Hits@1098.9 | 17 | |
| Link Prediction | YAGO37 (test) | MRR0.403 | 15 |