GNNs with ontology-derived semantic loss create hierarchy-aware box embeddings of a yeast knowledge graph that raise double-knockout growth prediction R² to 0.377 and generalize to triple knockouts while identifying a validated trait association.
Faithful Embeddings for
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
The thesis proposes specialized algebraic, logical, and geometric methods to enable scalable reasoning over imprecise attributes, probabilistic triples, and incomplete schemas in knowledge graphs.
citing papers explorer
-
Scalable Uncertainty Reasoning in Knowledge Graphs
The thesis proposes specialized algebraic, logical, and geometric methods to enable scalable reasoning over imprecise attributes, probabilistic triples, and incomplete schemas in knowledge graphs.