什么样的关系可以可靠地嵌入欧几里得空间?
What relations are reliably embeddable in Euclidean space?
摘要:
我们考虑的问题嵌入的关系,表示为一个有向图,到欧几里德空间。对于三种类型的嵌入动机最近的文献知识图谱,我们得到的关系,他们能够捕获的特征,以及所需的最小维数和精度的界限。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。