Enhancing Geometric Ontology Embeddings for EL++ with Negative Sampling and Deductive Closure Filtering
Not on the map. Why?
Abstract (arXiv)
Ontology embeddings map classes, relations, and individuals in ontologies into ℝn, and within ℝn similarity between entities can be computed or new axioms inferred. For ontologies in the Description Logic EL++, several embedding methods have been developed that explicitly generate models of an ontology. However, these methods suffer from some limitations; they do not distinguish between statements that are unprovable and provably false, and therefore they may use entailed statements as negatives. Furthermore, they do not utilize the deductive closure of an ontology to identify statements that are inferred but not asserted. We evaluated a set of embedding methods for EL++ ontologies based on high-dimensional ball representation of concept descriptions, incorporating several modifications that aim to make use of the ontology deductive closure. In particular, we designed novel negative losses that account both for the deductive closure and different types of negatives. We demonstrate that our embedding methods improve over the baseline ontology embedding in the task of knowledge base or ontology completion.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 11 of its 33 references that are in the map. First posted on arXiv 8 May 2024.
Builds on
11 of 33 references.
References · 11
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2020OWL2Vec*: Embedding of OWL Ontologiescited by 63
- 2019EL Embeddings: Geometric construction of models for the Description Logic EL ++cited by 48
- 2022Faithiful Embeddings for EL++ Knowledge Basescited by 25
- 2023Dual Box Embeddings for the Description Logic EL++cited by 21
- 2022Description Logic EL++ Embeddings with Intersectional Closurecited by 16
- 2024Ontology Completion with Natural Language Inference and Concept Embeddings: An Analysiscited by 4
- 2023From axioms over graphs to vectors, and back again: evaluating the properties of graph-based ontology embeddingscited by 3
- 2024A Self-matching Training Method with Annotation Embedding Models for Ontology Subsumption Predictioncited by 2
- 2023Ontology Revision based on Pre-trained Language Modelscited by 1
Built on by
Citing papers per year: 2024: 1.
1 paper.