Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Unsupervised Ontology- and Taxonomy Construction Through Hyperbolic Relational Domains and Ranges
KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Programvaruteknik och datorsystem, SCS. Gavagai AB, Stockholm, Sweden.ORCID-id: 0000-0002-8346-610X
KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Teoretisk datalogi, TCS. Ericsson Research, Stockholm, Sweden.ORCID-id: 0000-0002-0866-8342
Gavagai AB, Stockholm, Sweden.
KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Programvaruteknik och datorsystem, SCS.ORCID-id: 0000-0003-4516-7317
2025 (engelsk)Inngår i: Machine Learning and Principles and Practice of Knowledge Discovery in Databases - International Workshops of ECML PKDD 2023, Revised Selected Papers, Springer Nature , 2025, s. 339-348Konferansepaper, Publicerat paper (Fagfellevurdert)
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).

sted, utgiver, år, opplag, sider
Springer Nature , 2025. s. 339-348
Emneord [en]
Hyperbolic learning, Knowledge Graphs, Ontology Learning, Taxonomy Learning
HSV kategori
Identifikatorer
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
Konferanse
Joint European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML PKDD 2023, Turin, Italy, September 18-22, 2023
Merknad

Part of ISBN 9783031746321

QC 20250207

Tilgjengelig fra: 2025-02-06 Laget: 2025-02-06 Sist oppdatert: 2025-12-05bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Person

Cornell, FilipJin, YifeiGirdzijauskas, Sarunas

Søk i DiVA

Av forfatter/redaktør
Cornell, FilipJin, YifeiGirdzijauskas, Sarunas
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 190 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf