Completing Predicates Based on Alignment Rules from Knowledge Graphs

Publikation: Beitrag in Buch/Bericht/Sammelwerk/KonferenzbandAufsatz in KonferenzbandForschungPeer-Review

Autoren

  • Emetis Niazmand
  • Maria Esther Vidal

Externe Organisationen

  • Technische Informationsbibliothek (TIB) Leibniz-Informationszentrum Technik und Naturwissenschaften und Universitätsbibliothek
Forschungs-netzwerk anzeigen

Details

OriginalspracheEnglisch
Titel des SammelwerksDatabase and Expert Systems Applications
Untertitel35th International Conference, DEXA 2024, Proceedings
Herausgeber/-innenChristine Strauss, Toshiyuki Amagasa, Giuseppe Manco, Gabriele Kotsis, Ismail Khalil, A Min Tjoa
Herausgeber (Verlag)Springer Science and Business Media Deutschland GmbH
Seiten59-74
Seitenumfang16
ISBN (Print)9783031683084
PublikationsstatusVeröffentlicht - 18 Aug. 2024
Veranstaltung35th International Conference on Database and Expert Systems Applications, DEXA 2024 - Naples, Italien
Dauer: 26 Aug. 202428 Aug. 2024

Publikationsreihe

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Band14910 LNCS
ISSN (Print)0302-9743
ISSN (elektronisch)1611-3349

Abstract

Knowledge graphs (KGs) are dynamic structures, often shaped by diverse user communities, leading to the emergence of alternative representations for the same concepts. These alternative definitions, while enriching KGs with complementary information, also pose a challenge for downstream tasks by potentially impeding the completeness of the retrieved information. This paper tackles the problem of identifying alternative definitions of predicates within KGs. We present SYRUP, a method designed to uncover conjunctions of predicates that encapsulate the same semantic relationship as a given predicate but offer complementary instances. Through SYRUP, we aim to augment KG completeness by harnessing these alternative representations. To assess the effectiveness of SYRUP, we conduct an empirical study using a benchmark of 60 SPARQL queries over DBpedia, comprising six distinct domains. Our experimental results demonstrate improvements in both the completeness and correctness of query answers, with accuracy levels ranging from 0.73 to 0.95. Furthermore, we make SYRUP openly accessible on GitHub (https://github.com/SDM-TIB/SYRUP/), enabling researchers to replicate our experiments and integrate SYRUP into workflows for KG enhancement.

ASJC Scopus Sachgebiete

Zitieren

Completing Predicates Based on Alignment Rules from Knowledge Graphs. / Niazmand, Emetis; Vidal, Maria Esther.
Database and Expert Systems Applications : 35th International Conference, DEXA 2024, Proceedings. Hrsg. / Christine Strauss; Toshiyuki Amagasa; Giuseppe Manco; Gabriele Kotsis; Ismail Khalil; A Min Tjoa. Springer Science and Business Media Deutschland GmbH, 2024. S. 59-74 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 14910 LNCS).

Publikation: Beitrag in Buch/Bericht/Sammelwerk/KonferenzbandAufsatz in KonferenzbandForschungPeer-Review

Niazmand, E & Vidal, ME 2024, Completing Predicates Based on Alignment Rules from Knowledge Graphs. in C Strauss, T Amagasa, G Manco, G Kotsis, I Khalil & AM Tjoa (Hrsg.), Database and Expert Systems Applications : 35th International Conference, DEXA 2024, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bd. 14910 LNCS, Springer Science and Business Media Deutschland GmbH, S. 59-74, 35th International Conference on Database and Expert Systems Applications, DEXA 2024, Naples, Italien, 26 Aug. 2024. https://doi.org/10.1007/978-3-031-68309-1_5
Niazmand, E., & Vidal, M. E. (2024). Completing Predicates Based on Alignment Rules from Knowledge Graphs. In C. Strauss, T. Amagasa, G. Manco, G. Kotsis, I. Khalil, & A. M. Tjoa (Hrsg.), Database and Expert Systems Applications : 35th International Conference, DEXA 2024, Proceedings (S. 59-74). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 14910 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-68309-1_5
Niazmand E, Vidal ME. Completing Predicates Based on Alignment Rules from Knowledge Graphs. in Strauss C, Amagasa T, Manco G, Kotsis G, Khalil I, Tjoa AM, Hrsg., Database and Expert Systems Applications : 35th International Conference, DEXA 2024, Proceedings. Springer Science and Business Media Deutschland GmbH. 2024. S. 59-74. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-031-68309-1_5
Niazmand, Emetis ; Vidal, Maria Esther. / Completing Predicates Based on Alignment Rules from Knowledge Graphs. Database and Expert Systems Applications : 35th International Conference, DEXA 2024, Proceedings. Hrsg. / Christine Strauss ; Toshiyuki Amagasa ; Giuseppe Manco ; Gabriele Kotsis ; Ismail Khalil ; A Min Tjoa. Springer Science and Business Media Deutschland GmbH, 2024. S. 59-74 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Download
@inproceedings{ef2dcffb328a4a61b8985c121827d107,
title = "Completing Predicates Based on Alignment Rules from Knowledge Graphs",
abstract = "Knowledge graphs (KGs) are dynamic structures, often shaped by diverse user communities, leading to the emergence of alternative representations for the same concepts. These alternative definitions, while enriching KGs with complementary information, also pose a challenge for downstream tasks by potentially impeding the completeness of the retrieved information. This paper tackles the problem of identifying alternative definitions of predicates within KGs. We present SYRUP, a method designed to uncover conjunctions of predicates that encapsulate the same semantic relationship as a given predicate but offer complementary instances. Through SYRUP, we aim to augment KG completeness by harnessing these alternative representations. To assess the effectiveness of SYRUP, we conduct an empirical study using a benchmark of 60 SPARQL queries over DBpedia, comprising six distinct domains. Our experimental results demonstrate improvements in both the completeness and correctness of query answers, with accuracy levels ranging from 0.73 to 0.95. Furthermore, we make SYRUP openly accessible on GitHub (https://github.com/SDM-TIB/SYRUP/), enabling researchers to replicate our experiments and integrate SYRUP into workflows for KG enhancement.",
keywords = "Alternative Definition, Completeness, Knowledge Graph",
author = "Emetis Niazmand and Vidal, {Maria Esther}",
note = "Publisher Copyright: {\textcopyright} The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.; 35th International Conference on Database and Expert Systems Applications, DEXA 2024 ; Conference date: 26-08-2024 Through 28-08-2024",
year = "2024",
month = aug,
day = "18",
doi = "10.1007/978-3-031-68309-1_5",
language = "English",
isbn = "9783031683084",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "59--74",
editor = "Christine Strauss and Toshiyuki Amagasa and Giuseppe Manco and Gabriele Kotsis and Ismail Khalil and Tjoa, {A Min}",
booktitle = "Database and Expert Systems Applications",
address = "Germany",

}

Download

TY - GEN

T1 - Completing Predicates Based on Alignment Rules from Knowledge Graphs

AU - Niazmand, Emetis

AU - Vidal, Maria Esther

N1 - Publisher Copyright: © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

PY - 2024/8/18

Y1 - 2024/8/18

N2 - Knowledge graphs (KGs) are dynamic structures, often shaped by diverse user communities, leading to the emergence of alternative representations for the same concepts. These alternative definitions, while enriching KGs with complementary information, also pose a challenge for downstream tasks by potentially impeding the completeness of the retrieved information. This paper tackles the problem of identifying alternative definitions of predicates within KGs. We present SYRUP, a method designed to uncover conjunctions of predicates that encapsulate the same semantic relationship as a given predicate but offer complementary instances. Through SYRUP, we aim to augment KG completeness by harnessing these alternative representations. To assess the effectiveness of SYRUP, we conduct an empirical study using a benchmark of 60 SPARQL queries over DBpedia, comprising six distinct domains. Our experimental results demonstrate improvements in both the completeness and correctness of query answers, with accuracy levels ranging from 0.73 to 0.95. Furthermore, we make SYRUP openly accessible on GitHub (https://github.com/SDM-TIB/SYRUP/), enabling researchers to replicate our experiments and integrate SYRUP into workflows for KG enhancement.

AB - Knowledge graphs (KGs) are dynamic structures, often shaped by diverse user communities, leading to the emergence of alternative representations for the same concepts. These alternative definitions, while enriching KGs with complementary information, also pose a challenge for downstream tasks by potentially impeding the completeness of the retrieved information. This paper tackles the problem of identifying alternative definitions of predicates within KGs. We present SYRUP, a method designed to uncover conjunctions of predicates that encapsulate the same semantic relationship as a given predicate but offer complementary instances. Through SYRUP, we aim to augment KG completeness by harnessing these alternative representations. To assess the effectiveness of SYRUP, we conduct an empirical study using a benchmark of 60 SPARQL queries over DBpedia, comprising six distinct domains. Our experimental results demonstrate improvements in both the completeness and correctness of query answers, with accuracy levels ranging from 0.73 to 0.95. Furthermore, we make SYRUP openly accessible on GitHub (https://github.com/SDM-TIB/SYRUP/), enabling researchers to replicate our experiments and integrate SYRUP into workflows for KG enhancement.

KW - Alternative Definition

KW - Completeness

KW - Knowledge Graph

UR - http://www.scopus.com/inward/record.url?scp=85202204599&partnerID=8YFLogxK

U2 - 10.1007/978-3-031-68309-1_5

DO - 10.1007/978-3-031-68309-1_5

M3 - Conference contribution

AN - SCOPUS:85202204599

SN - 9783031683084

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 59

EP - 74

BT - Database and Expert Systems Applications

A2 - Strauss, Christine

A2 - Amagasa, Toshiyuki

A2 - Manco, Giuseppe

A2 - Kotsis, Gabriele

A2 - Khalil, Ismail

A2 - Tjoa, A Min

PB - Springer Science and Business Media Deutschland GmbH

T2 - 35th International Conference on Database and Expert Systems Applications, DEXA 2024

Y2 - 26 August 2024 through 28 August 2024

ER -