Approximate answering of graph queries

Publikation: Bidrag til bog/antologi/rapportBidrag til bog/antologiForskningfagfællebedømt

Dokumenter

  • Fulltext

    Indsendt manuskript, 311 KB, PDF-dokument

  • Michael Cochez
  • Dimitrios Alivanistos
  • Arakelyan, Erik
  • Max Berrendorf
  • Daniel Daza
  • Mikhail Galkin
  • Pasquale Minervini
  • Mathias Niepert
  • Hongyu Ren

Knowledge graphs (KGs) are inherently incomplete because of incomplete world knowledge and bias in what is the input to the KG. Additionally, world knowledge constantly expands and evolves, making existing facts deprecated or introducing new ones. However, we would still want to be able to answer queries as if the graph were complete. In this chapter, we will give an overview of several methods which have been proposed to answer queries in such a setting. We will first provide an overview of the different query types which can be supported by these methods and datasets typically used for evaluation, as well as an insight into their limitations. Then, we give an overview of the different approaches and describe them in terms of expressiveness, supported graph types, and inference capabilities.

OriginalsprogEngelsk
TitelCompendium of Neurosymbolic Artificial Intelligence
Antal sider14
ForlagIOS Press
Publikationsdato2023
Sider373-386
Kapitel17
ISBN (Trykt)9781643684062
ISBN (Elektronisk)9781643684079
DOI
StatusUdgivet - 2023
NavnFrontiers in Artificial Intelligence and Applications
Vol/bind369
ISSN0922-6389

Bibliografisk note

Publisher Copyright:
© 2023 The authors and IOS Press. All rights reserved.

ID: 391745468