尝试阅读和理解 PairRE: Knowledge Graph Embeddings via Paired Relation Vectors

文章提出面临的问题

Since most knowledge graphs suffer from incompleteness, predicting missing links between entities has been a fundamental problem. This problem is named as link prediction or knowledge graph completion.

针对这个问题的解决办法

Knowledge graph embedding methods, which embed all entities and relations into alow dimensional space, have been proposed for this problem.

文章中对于这个PairRE的大概描述

The proposed model uses two vectors for relation representation. These vectors project the corresponding head and tail entities to Euclidean space, where the distance between the projected vectors is minimized.

对于这个文章即 PairRE 的贡献

Further analysis also proves that PairRE can better handle complex relations and encode symmetry/antisymmetry, inverse, composition and subrelation relations.