AICLMar 12, 2019

Interaction Embeddings for Prediction and Explanation in Knowledge Graphs

arXiv:1903.04750v1211 citations
Originality Highly original
AI Analysis

This work addresses the need for more interpretable and effective knowledge graph embeddings, which is important for applications like link prediction and explanation generation in AI systems, though it is incremental in building on existing embedding methods.

The paper tackles the problem of knowledge graph embedding by introducing CrossE, a method that explicitly models crossover interactions between entities and relations, achieving state-of-the-art results on link prediction tasks and demonstrating improved capability in generating reliable explanations for predicted triples.

Knowledge graph embedding aims to learn distributed representations for entities and relations, and is proven to be effective in many applications. Crossover interactions --- bi-directional effects between entities and relations --- help select related information when predicting a new triple, but haven't been formally discussed before. In this paper, we propose CrossE, a novel knowledge graph embedding which explicitly simulates crossover interactions. It not only learns one general embedding for each entity and relation as most previous methods do, but also generates multiple triple specific embeddings for both of them, named interaction embeddings. We evaluate embeddings on typical link prediction tasks and find that CrossE achieves state-of-the-art results on complex and more challenging datasets. Furthermore, we evaluate embeddings from a new perspective --- giving explanations for predicted triples, which is important for real applications. In this work, an explanation for a triple is regarded as a reliable closed-path between the head and the tail entity. Compared to other baselines, we show experimentally that CrossE, benefiting from interaction embeddings, is more capable of generating reliable explanations to support its predictions.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes