Explainable Representations for Relation Prediction in Knowledge Graphs

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Knowledge graphs represent real-world entities and their relations in a semantically-rich structure supported by ontologies. Exploring this data with machine learning methods often relies on knowledge graph embeddings, which produce latent representations of entities that preserve structural and local graph neighbourhood properties, but sacrifice explainability. However, in tasks such as link or relation prediction, understanding which specific features better explain a relation is crucial to support complex or critical applications. We propose SEEK, a novel approach for explainable representations to support relation prediction in knowledge graphs. It is based on identifying relevant shared semantic aspects (i.e., subgraphs) between entities and learning representations for each subgraph, producing a multi-faceted and explainable representation. We evaluate SEEK on two real-world highly complex relation prediction tasks: protein-protein interaction prediction and gene-disease association prediction. Our extensive analysis using established benchmarks demonstrates that SEEK achieves significantly better performance than standard learning representation methods while identifying both sufficient and necessary explanations based on shared semantic aspects.

Cite

CITATION STYLE

APA

Sousa, R. T., Silva, S., & Pesquita, C. (2023). Explainable Representations for Relation Prediction in Knowledge Graphs. In Proceedings of the International Conference on Knowledge Representation and Reasoning (pp. 635–646). Association for the Advancement of Artificial Intelligence. https://doi.org/10.24963/kr.2023/62

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free