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.
Code (0)
등록된 구현이 없습니다.
Tasks
Knowledge GraphsRelationSimilar Papers 제목 키워드 기반
High-Dimensional Simplexes for Supermetric Search
In 1953, Blumenthal showed that every semi-metric space that is isometrically embeddable in a Hilbert space has the n-point property; we have previously called such spaces supermetric spaces. Although this is a strictly …
Vocal Bursts Intensity PredictionHilbert Exclusion: Improved Metric Search through Finite Isometric Embeddings
Most research into similarity search in metric spaces relies upon the triangle inequality property. This property allows the space to be arranged according to relative distances to avoid searching some subspaces. We show…
Validity of Clusters Produced By kernel-$k$-means With Kernel-Trick
This paper corrects the proof of the Theorem 2 from the Gower's paper \cite[page 5]{Gower:1982} as well as corrects the Theorem 7 from Gower's paper \cite{Gower:1986}. The first correction is needed in order to establish…
ClusteringSupermetric Search
Metric search is concerned with the efficient evaluation of queries in metric spaces. In general,a large space of objects is arranged in such a way that, when a further object is presented as a query, those objects most …
kHGCN: Tree-likeness Modeling via Continuous and Discrete Curvature Learning
The prevalence of tree-like structures, encompassing hierarchical structures and power law distributions, exists extensively in real-world applications, including recommendation systems, ecosystems, financial networks, s…
Link PredictionNode ClassificationRecommendation SystemsRepresentation Learning