Link Prediction with Attention Applied on Multiple Knowledge Graph Embedding Models
Cosimo Gregucci, Mojtaba Nayyeri, Daniel Hern\'andez, Steffen, Staab

TL;DR
This paper introduces a novel approach that combines multiple knowledge graph embedding models using attention mechanisms and non-Euclidean geometry to improve link prediction by capturing diverse relational and structural patterns.
Contribution
The paper proposes a unified model that integrates several embedding models with attention and Poincaré ball geometry, enhancing pattern learning and outperforming individual models.
Findings
Combined model outperforms individual models on benchmarks.
Attention mechanism effectively selects the best model per query.
Mapping to Poincaré ball captures hierarchies and relations.
Abstract
Predicting missing links between entities in a knowledge graph is a fundamental task to deal with the incompleteness of data on the Web. Knowledge graph embeddings map nodes into a vector space to predict new links, scoring them according to geometric criteria. Relations in the graph may follow patterns that can be learned, e.g., some relations might be symmetric and others might be hierarchical. However, the learning capability of different embedding models varies for each pattern and, so far, no single model can learn all patterns equally well. In this paper, we combine the query representations from several models in a unified one to incorporate patterns that are independently captured by each model. Our combination uses attention to select the most suitable model to answer each query. The models are also mapped onto a non-Euclidean manifold, the Poincar\'e ball, to capture…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
