Multi-label Learning with a Cone-Based Geometric Model

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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. This paper investigates a new approach to embedding ontologies into geometric models that interpret concepts by closed convex cones. As a proof of concept this cone-based embedding was implemented in a ML algorithm for weak supervised multi-label learning. The system was tested with the gene ontology and showed a performance similar to comparable approaches, but with the advantage of exhibiting the conceptual structure underlying the data.

Cite

CITATION STYLE

APA

Leemhuis, M., Özçep, Ö. L., & Wolter, D. (2020). Multi-label Learning with a Cone-Based Geometric Model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12277 LNAI, pp. 177–185). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-57855-8_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free