Graph Neural Network based Hierarchy-Aware Embeddings of Knowledge Graphs: Applications to Yeast Phenotype Prediction
Not on the map. Why?
Abstract (arXiv)
We present a method for finding hierarchy-aware embeddings of knowledge graphs (KGs) using graph neural networks (GNNs) enriched with a semantic loss derived from underlying ontologies. This method yields embeddings that better reflect domain knowledge. To demonstrate their utility, we predict and interpret the effects of gene deletions in the yeast Saccharomyces cerevisiae and learn box embeddings for KGs in the absence of a prediction task. We further show how box embeddings can serve as the basis for evaluating KG revisions. Our yeast KG is constructed from community databases and ontology terms. Low-dimensional box embeddings combined with GNNs are used to predict cell growth for double gene knockouts. Over 10-fold cross validation, these predictions have a mean R2~score~of~0.360, significantly higher than baseline comparisons, demonstrating that high-level qualitative knowledge is informative about experimental outcomes. Incorporating semantic loss terms in the training of the models improves their predictive performance (R2=0.377) by aligning embeddings with ontology structure. This shows that class hierarchies from ontologies can be exploited for quantitative prediction. We also test the trained models on triple gene knockouts, showing they generalise to data beyond those seen in training. Additionally, by identifying co-occurring relations in the yeast KG important for the cell-growth predictions, we construct hypotheses about interacting traits in yeast. A biological experiment validates one such finding, revealing an association between inositol utilisation and osmotic stress resistance, highlighting the model's potential to guide biological discovery.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 24 of its 61 references that are in the map. First posted on arXiv 5 May 2026.
Builds on
24 of 61 references.
References · 24
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
- 2017Modeling Relational Data with Graph Convolutional Networkscited by 1,694
- 2014Embedding Entities and Relations for Learning and Inference in Knowledge Basescited by 932
- 2016Complex Embeddings for Simple Link Predictioncited by 902
- 2019RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Spacecited by 898
- 2021How Attentive are Graph Attention Networks?cited by 835
- 2017Poincar'e Embeddings for Learning Hierarchical Representationscited by 684
- 2020Captum: A unified and generic model interpretability library for PyTorchcited by 547
- 2016Not Just a Black Box: Learning Important Features Through Propagating Activation Differencescited by 297
- 2017A Semantic Loss Function for Deep Learning with Symbolic Knowledgecited by 270
12 more
- 2018Hyperbolic Entailment Cones for Learning Hierarchical Embeddingscited by 162
- 2019Learning Hierarchy-Aware Knowledge Graph Embeddings for Link Predictioncited by 133
- 2018Probabilistic Embedding of Knowledge Graphs with Box Lattice Measurescited by 64
- 2019EL Embeddings: Geometric construction of models for the Description Logic EL ++cited by 48
- 2020Improving Local Identifiability in Probabilistic Box Embeddingscited by 35
- 2022Faithiful Embeddings for EL++ Knowledge Basescited by 25
- 2023Dual Box Embeddings for the Description Logic EL++cited by 21
- 2018From Knowledge Graph Embedding to Ontology Embedding? An Analysis of the Compatibility between Vector Space Representations and Rulescited by 19
- 2021Box Embeddings: An open-source library for representation learning using geometric structurescited by 9
- 2024TransBox: EL++-closed Ontology Embeddingcited by 5
- 2019Performance of regression models as a function of experiment noisecited by 4
- 2024When Box Meets Graph Neural Network in Tag-aware Recommendationcited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.