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 › Fast Pathfinding in Knowledge Graphs Using Word Embeddings

Publikation

Fast Pathfinding in Knowledge Graphs Using Word Embeddings

Martin, Leon; Boockmann, Jan H.; Henrich, Andreas (2025): Fast Pathfinding in Knowledge Graphs Using Word Embeddings, in: Bamberg: Otto-Friedrich-Universität, S. 305–312.

Details

Fakultät/Lehrstuhl
Autorin(nen)/Autor(en)
Martin, Leon
Boockmann, Jan H.
Verlagsangabe
Otto-Friedrich-Universität : Bamberg
Erscheinungsjahr
2025
Quelle/Weitere Ausgabe
Ute Schmid, Franziska Klügl, Diedrich Wolter, u. a. (Hrsg.), KI 2020: Advances in Artificial Intelligence : 43rd German Conference on AI, Bamberg, Germany, September 21–25, 2020, Proceedings, Cham: Springer, 2020, S. 305–312, ISBN: 978-3-030-58284-5
Jahr der Erstpublikation
2020
Sprache(n)
Englisch
Lizenz
URN
Abstract

Knowledge graphs, which model relationships between entities, provide a rich and structured source of information. Currently, search engines aim to enrich their search results by structured summaries, e.g., obtained from knowledge graphs, that provide further information on the entity of interest. While single entity summaries are available already, summaries on the relations between multiple entities have not been studied in detail so far. Such queries can be understood as a pathfinding problem. However, the large size of public knowledge graphs, such as Wikidata, as well as the large indegree of its major entities, and the problem of concept drift impose major challenges for standard search algorithms in this context.

In this paper, we propose a bidirectional pathfinding approach for directed knowledge graphs that uses the semantic distance between entity labels, which is approximated using word vectors, as a search heuristics in a parameterized A*-like evaluation function in order to find meaningful paths between two entities fast. We evaluate our approach using different parameters against a set of selected within- and cross-domain queries. The results indicate that our approach generally needs to explore fewer entities compared to its uninformed counterpart and qualitatively yields more meaningful paths.

Freie Schlagwort(e)
Knowledge graphs
Word embeddings
Pathfinding
Dokumenttyp
Konferenzveröffentlichung
URI
Datum der Freischaltung
10.11.2025

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

Datenstand: 16.11.2026

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