kth.sePublications KTH
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Unsupervised Ontology- and Taxonomy Construction Through Hyperbolic Relational Domains and Ranges
KTH, School of Electrical Engineering and Computer Science (EECS), Computer Science, Software and Computer systems, SCS. Gavagai AB, Stockholm, Sweden.ORCID iD: 0000-0002-8346-610X
KTH, School of Electrical Engineering and Computer Science (EECS), Computer Science, Theoretical Computer Science, TCS. Ericsson Research, Stockholm, Sweden.ORCID iD: 0000-0002-0866-8342
Gavagai AB, Stockholm, Sweden.
KTH, School of Electrical Engineering and Computer Science (EECS), Computer Science, Software and Computer systems, SCS.ORCID iD: 0000-0003-4516-7317
2025 (English)In: Machine Learning and Principles and Practice of Knowledge Discovery in Databases - International Workshops of ECML PKDD 2023, Revised Selected Papers, Springer Nature , 2025, p. 339-348Conference paper, Published paper (Refereed)
Abstract [en]

The sets of possible heads and tails for relations in a Knowledge Graph and a type taxonomy of participating entities are important aspects of a Knowledge Graph and constitute a large portion of a Knowledge Graph’s ontology. Making the ontology explicit helps to ensure consistency of the knowledge represented in the graph and allows for less costly maintenance and update of graph content. However, Knowledge Graphs are often conveniently formed without an explicitly described ontology, using only (head, relation, tail)-tuples. For such graphs without predefined structure, we propose learning an ontology and a hierarchical type taxonomy from the graph itself, taking advantage of the reciprocity of entity types and sets of possible heads (relational domains) and tails (relational ranges). Experiments on real-world datasets validate our approach and demonstrate the promise for leveraging machine learning methodologies to efficiently generate taxonomies and ontologies jointly for Knowledge Graphs (Our implementation can be found at https://tinyurl.com/5n6sw6yj).

Place, publisher, year, edition, pages
Springer Nature , 2025. p. 339-348
Keywords [en]
Hyperbolic learning, Knowledge Graphs, Ontology Learning, Taxonomy Learning
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:kth:diva-359658DOI: 10.1007/978-3-031-74633-8_23ISI: 001437448200023Scopus ID: 2-s2.0-85216103400OAI: oai:DiVA.org:kth-359658DiVA, id: diva2:1935402
Conference
Joint European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML PKDD 2023, Turin, Italy, September 18-22, 2023
Note

Part of ISBN 9783031746321

QC 20250207

Available from: 2025-02-06 Created: 2025-02-06 Last updated: 2025-12-05Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Cornell, FilipJin, YifeiGirdzijauskas, Sarunas

Search in DiVA

By author/editor
Cornell, FilipJin, YifeiGirdzijauskas, Sarunas
By organisation
Software and Computer systems, SCSTheoretical Computer Science, TCS
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 189 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf