Interaction Embeddings for Prediction and Explanation in Knowledge Graphs (1903.04750v1)

Abstract: 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.

Interaction Embeddings for Prediction and Explanation in Knowledge Graphs: An Analysis

The paper introduces a novel approach to knowledge graph embedding (KGE) by presenting CrossE, which focuses on modeling crossover interactions within knowledge graphs. The primary objective of CrossE is to enhance the prediction of triples and their explanations by explicitly incorporating the interactions between entities and relations. The paper emphasizes that existing KGE methods do not formally address these crossover interactions, a gap that CrossE aims to fill.

Knowledge graph embeddings facilitate the representation of entities and relations in a continuous vector space. Despite the efficacy of previous methods in various applications, most have overlooked the mutual influences between entities and relations. This paper proposes that these interactions are pivotal for selecting relevant information while predicting new triples. CrossE conceptualizes these interactions as bi-directional effects that dynamically influence the embeddings of entities and relations.

CrossE outperforms prior KGE methods on conventional link prediction tasks, demonstrating enhanced capability to handle complex datasets. This is largely due to its architecture which generates multiple interaction embeddings specific to each triple. These embeddings are derived through an interaction matrix, effectively capturing the crossover interactions. The approach is distinctive because it produces different embeddings for entities and relations depending on the specific context of the triple, unlike many previous methods which generate static embeddings.

Empirically, CrossE exhibits state-of-the-art results on difficult datasets like FB15k-237, which provides a more challenging testbed due to its elimination of inverse relations, a feature that many simpler methods exploit. The paper competes favorably against a multitude of baselines, especially those dealing with challenging relation types, such as one-to-many and many-to-one.

Beyond accuracy in link prediction, CrossE introduces a supplementary evaluation strategy by searching for explanations of the generated predictions. Explanations are formulated as reliable paths through the knowledge graph, thereby improving the transparency and perceived reliability of predictions. The paper offers a robust mechanism for creating and evaluating explanations based on the concept of similar structures. These similar structures are identified by analyzing paths with similar relational configurations. CrossE noticeably outshines older methods in providing richer explanations supported by a greater number of similar structures, an accomplishment attributed to its sophisticated embedding approach.

The implications of CrossE are multifaceted. Practically, its enhanced predictive accuracy and ability to generate explanations provide valuable insights for real-world applications like question answering and semantic search. Theoretically, CrossE paves the way for further exploration into dynamic embeddings that capture context-dependent interactions in knowledge graphs. It could catalyze future research focusing on embedding methods that prioritize both accurate prediction and comprehensive explanation.

In conclusion, the paper argues convincingly for the necessity of considering crossover interactions to facilitate superior performance in knowledge graph embeddings. By showcasing CrossE's ability to achieve both state-of-the-art results in link prediction and reliable explanations of its predictions, the authors have provided a significant contribution that could steer the future direction of KGE research towards more contextually aware models.