Skip to content

Read-only version: For security reasons, the Research Information System (FIS) has been temporarily replaced by this read-only version. All public content and full texts remain available; login, editing, submission and statistics are not available. Questions: fis@uni-bamberg.de

Home › Publications › Learning with cone-based geometric models and orthologics

Publication

Learning with cone-based geometric models and orthologics

Leemhuis, Mena; Özgür, L. Özçep; Wolter, Diedrich (2022): Learning with cone-based geometric models and orthologics, in: Annals of mathematics and artificial intelligence, Dordrecht [u.a.]: Springer Science + Business Media B.V, Jg. 90, Nr. 11–12, S. 1159–1195, doi: 10.1007/s10472-022-09806-1.

Details

Faculty/Chair
Faculty/Professorship
Author
Leemhuis, Mena
Özgür, L. Özçep
Wolter, Diedrich
Title of the Journal
Annals of mathematics and artificial intelligence
ISSN
1012-2443
1573-7470
Publisher Information
Springer Science + Business Media B.V : Dordrecht [u.a.]
Year of publication
2022
Volume
90
Issue
11-12
Language
English
DOI
Abstract

Recent approaches for knowledge-graph embeddings aim at connecting quantitative data structures used in machine learning to the qualitative structures of logics. Such embeddings are of a hybrid nature, they are data models that also exhibit conceptual structures inherent to logics. One motivation to investigate embeddings is to design conceptually adequate machine learning (ML) algorithms that learn or incorporate ontologies expressed in some logic. This paper investigates a new approach to embedding ontologies into geometric models that interpret concepts by geometrical structures based on convex cones. The ontologies are assumed to be represented in an orthologic, a logic with a full (ortho)negation. As a proof of concept this cone-based embedding was implemented within two ML algorithms for weak supervised multi-label learning. Both algorithms rely on cones but the first addresses ontologies expressed in classical propositional logic whereas the second addresses a weaker propositional logic, namely a weak orthologic that does not fulfil distributivity. The algorithms were evaluated and showed promising results that call for investigating other (sub)classes of cones and developing fine-tuned algorithms based on them.

GND Keywords
Begriffsbildung
Wissensgraph
Support-Vektor-Maschine
Maschinelles Lernen
Keywords
Concept learning
Knowledge graph embedding
Support-vector machine
Multi-label learning
Orthologic
DDC Classification
004 Computer science
RVK Classification
ST 304
Type
Article
URI
Activation date
2023-11-06

Permalink: https://fis.uni-bamberg.de/handle/uniba/91605 · Data as JSON · Cite: BibTeX · RIS

Data as of: 2026-11-16

Restricted read-only access: login, editing and submission are temporarily disabled.