SpherE: Expressive and Interpretable Knowledge Graph Embedding for Set Retrieval
Zihao Li, Yuyi Ao, Jingrui He

TL;DR
This paper introduces SpherE, a novel knowledge graph embedding model that uses spherical embeddings to effectively perform set retrieval tasks, capturing complex relations with high interpretability and accuracy.
Contribution
SpherE is the first model to embed entities as spheres for set retrieval, enhancing expressiveness and interpretability over traditional vector-based methods.
Findings
SpherE effectively models many-to-many relations.
SpherE achieves high accuracy in set retrieval tasks.
The model maintains good predictive performance for missing facts.
Abstract
Knowledge graphs (KGs), which store an extensive number of relational facts (head, relation, tail), serve various applications. While many downstream tasks highly rely on the expressive modeling and predictive embedding of KGs, most of the current KG representation learning methods, where each entity is embedded as a vector in the Euclidean space and each relation is embedded as a transformation, follow an entity ranking protocol. On one hand, such an embedding design cannot capture many-to-many relations. On the other hand, in many retrieval cases, the users wish to get an exact set of answers without any ranking, especially when the results are expected to be precise, e.g., which genes cause an illness. Such scenarios are commonly referred to as "set retrieval". This work presents a pioneering study on the KG set retrieval problem. We show that the set retrieval highly depends on…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Topic Modeling · Domain Adaptation and Few-Shot Learning
MethodsSparse Evolutionary Training
