Zum Inhalt springen

Nur-Lesen-Fassung: Das Forschungsinformationssystem (FIS) ist aus Sicherheitsgründen vorübergehend durch diese Nur-Lesen-Fassung ersetzt. Alle öffentlichen Inhalte und Volltexte sind weiterhin abrufbar; Anmeldung, Bearbeitung, Einreichung und Statistiken stehen nicht zur Verfügung. Bei Fragen: fis@uni-bamberg.de

Start › Publikationen › Learning with cone-based geometric models and orthologics

Publikation

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

Fakultät/Lehrstuhl
Autorin(nen)/Autor(en)
Leemhuis, Mena
Özgür, L. Özçep
Wolter, Diedrich
Titel der Zeitschrift
Annals of mathematics and artificial intelligence
ISSN
1012-2443
1573-7470
Verlagsangabe
Springer Science + Business Media B.V : Dordrecht [u.a.]
Erscheinungsjahr
2022
Jahrgang
90
Heft
11-12
Sprache(n)
Englisch
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-Schlagwort(e)
Begriffsbildung
Wissensgraph
Support-Vektor-Maschine
Maschinelles Lernen
Freie Schlagwort(e)
Concept learning
Knowledge graph embedding
Support-vector machine
Multi-label learning
Orthologic
DDC-Klassifikation
004 Computer science
RVK-Klassifikation
ST 304
Dokumenttyp
Artikel in einer Zeitschrift / Postprint
URI
Datum der Freischaltung
06.11.2023

Permalink: https://fis.uni-bamberg.de/handle/uniba/91605 · Daten als JSON · Zitieren: BibTeX · RIS

Datenstand: 15.11.2026

Eingeschränkter Lesezugriff: Anmeldung, Bearbeitung und Einreichung sind vorübergehend deaktiviert.