We consider the problem of embedding a relation, represented as a directed graph, into Euclidean space. For three types of embeddings motivated by the recent literature on knowledge graphs, we obtain characterizations of which relations they are able to capture, as well as bounds on the minimal dimensionality and precision needed.
翻译:我们考虑了将一种以定向图表为代表的关系嵌入欧几里德空间的问题。 对于最近知识图表文献所激发的三种类型的嵌入,我们获得了他们能够捕捉到的关系的特点,以及所需的最低维度和精确度的界限。