Coverage-Based Summaries for RDF KBs

Giannis Vassiliou; Georgia Troullinou; Nikos Papadakis; Kostas Stefanidis; Evangelia Pitoura; Haridimos Kondylakis

doi:10.1007/978-3-030-80418-3_18

Coverage-Based Summaries for RDF KBs

Giannis Vassiliou
, Georgia Troullinou
, Nikos Papadakis
, Kostas Stefanidis
, Evangelia Pitoura
, Haridimos Kondylakis^*

^*Tämän työn vastaava kirjoittaja

Tietotekniikka

Tutkimustuotos: Konferenssiartikkeli › Tieteellinen › vertaisarvioitu

4 Sitaatiot (Scopus)

11 Lataukset (Pure)

Abstrakti

As more and more data become available as linked data, the need for efficient and effective methods for their exploration becomes apparent. Semantic summaries try to extract meaning from data, while reducing its size. State of the art structural semantic summaries, focus primarily on the graph structure of the data, trying to maximize the summary’s utility for query answering, i.e. the query coverage. In this poster paper, we present an algorithm, trying to maximize the aforementioned query coverage, using ideas borrowed from result diversification. The key idea of our algorithm is that, instead of focusing only to the “central” nodes, to push node selection also to the perimeter of the graph. Our experiments show the potential of our algorithm and demonstrate the considerable advantages gained for answering larger fragments of user queries.

Alkuperäiskieli	Englanti
Otsikko	The Semantic Web
Alaotsikko	ESWC 2021 Satellite Events, Revised Selected Papers
Toimittajat	Ruben Verborgh, Anastasia Dimou, Aidan Hogan, Claudia d’Amato, Ilaria Tiddi, Arne Bröring, Simon Maier, Femke Ongenae, Riccardo Tommasini, Mehwish Alam
Kustantaja	Springer
Sivut	98-102
Sivumäärä	5
ISBN (painettu)	9783030804176
DOI - pysyväislinkit	https://doi.org/10.1007/978-3-030-80418-3_18
Tila	Julkaistu - 2021
OKM-julkaisutyyppi	A4 Artikkeli konferenssijulkaisussa
Tapahtuma	Extended Semantic Web Conference - Kesto: 6 kesäk. 2021 → 10 kesäk. 2021

Julkaisusarja

Nimi	Lecture Notes in Computer Science
Vuosikerta	12739 LNCS
ISSN (painettu)	0302-9743
ISSN (elektroninen)	1611-3349

Conference

Conference	Extended Semantic Web Conference
Ajanjakso	6/06/21 → 10/06/21

Rahoitus

This research project was supported by the Hellenic Foundation for Research and Innovation (H.F.R.I.) under the ?2nd Call for H.F.R.I. Research Projects to support Post-Doctoral Researchers? (iQARuS Project No. 1147).

Julkaisufoorumi-taso

Jufo-taso 1

!!ASJC Scopus subject areas

Theoretical Computer Science
Yleinen tietojenkäsittelytiede

Pääsy asiakirjaan

10.1007/978-3-030-80418-3_18

eswc2021
This publication is copyrighted. You may download, display and print it for Your own personal use. Commercial use is prohibited.
Accepted author manuscript, 623 KBLisenssi: Unspecified

https://urn.fi/URN:NBN:fi:tuni-202210267889Lisenssi: Unspecified

Siteeraa tätä

Vassiliou, G., Troullinou, G., Papadakis, N., Stefanidis, K., Pitoura, E., & Kondylakis, H. (2021). Coverage-Based Summaries for RDF KBs. teoksessa R. Verborgh, A. Dimou, A. Hogan, C. d’Amato, I. Tiddi, A. Bröring, S. Maier, F. Ongenae, R. Tommasini, & M. Alam (Toimittajat), The Semantic Web: ESWC 2021 Satellite Events, Revised Selected Papers (Sivut 98-102). (Lecture Notes in Computer Science; Vuosikerta 12739 LNCS). Springer. https://doi.org/10.1007/978-3-030-80418-3_18

Vassiliou, Giannis ; Troullinou, Georgia ; Papadakis, Nikos et al. / Coverage-Based Summaries for RDF KBs. The Semantic Web: ESWC 2021 Satellite Events, Revised Selected Papers. Toimittaja / Ruben Verborgh ; Anastasia Dimou ; Aidan Hogan ; Claudia d’Amato ; Ilaria Tiddi ; Arne Bröring ; Simon Maier ; Femke Ongenae ; Riccardo Tommasini ; Mehwish Alam. Springer, 2021. Sivut 98-102 (Lecture Notes in Computer Science).

@inproceedings{a6aeeeb9a13f42a387635c08c08f2f02,

title = "Coverage-Based Summaries for RDF KBs",

abstract = "As more and more data become available as linked data, the need for efficient and effective methods for their exploration becomes apparent. Semantic summaries try to extract meaning from data, while reducing its size. State of the art structural semantic summaries, focus primarily on the graph structure of the data, trying to maximize the summary{\textquoteright}s utility for query answering, i.e. the query coverage. In this poster paper, we present an algorithm, trying to maximize the aforementioned query coverage, using ideas borrowed from result diversification. The key idea of our algorithm is that, instead of focusing only to the “central” nodes, to push node selection also to the perimeter of the graph. Our experiments show the potential of our algorithm and demonstrate the considerable advantages gained for answering larger fragments of user queries.",

author = "Giannis Vassiliou and Georgia Troullinou and Nikos Papadakis and Kostas Stefanidis and Evangelia Pitoura and Haridimos Kondylakis",

note = "Funding Information: This research project was supported by the Hellenic Foundation for Research and Innovation (H.F.R.I.) under the ?2nd Call for H.F.R.I. Research Projects to support Post-Doctoral Researchers? (iQARuS Project No. 1147). Publisher Copyright: {\textcopyright} 2021, Springer Nature Switzerland AG. jufoid=62555; Extended Semantic Web Conference ; Conference date: 06-06-2021 Through 10-06-2021",

year = "2021",

doi = "10.1007/978-3-030-80418-3\_18",

language = "English",

isbn = "9783030804176",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "98--102",

editor = "Ruben Verborgh and Anastasia Dimou and Aidan Hogan and Claudia d{\textquoteright}Amato and Ilaria Tiddi and Arne Br{\"o}ring and Simon Maier and Femke Ongenae and Riccardo Tommasini and Mehwish Alam",

booktitle = "The Semantic Web",

}

Vassiliou, G, Troullinou, G, Papadakis, N, Stefanidis, K, Pitoura, E & Kondylakis, H 2021, Coverage-Based Summaries for RDF KBs. julkaisussa R Verborgh, A Dimou, A Hogan, C d’Amato, I Tiddi, A Bröring, S Maier, F Ongenae, R Tommasini & M Alam (toim), The Semantic Web: ESWC 2021 Satellite Events, Revised Selected Papers. Lecture Notes in Computer Science, Vuosikerta 12739 LNCS, Springer, Sivut 98-102, Extended Semantic Web Conference, 6/06/21. https://doi.org/10.1007/978-3-030-80418-3_18

Coverage-Based Summaries for RDF KBs. / Vassiliou, Giannis; Troullinou, Georgia; Papadakis, Nikos et al.
The Semantic Web: ESWC 2021 Satellite Events, Revised Selected Papers. toim. / Ruben Verborgh; Anastasia Dimou; Aidan Hogan; Claudia d’Amato; Ilaria Tiddi; Arne Bröring; Simon Maier; Femke Ongenae; Riccardo Tommasini; Mehwish Alam. Springer, 2021. s. 98-102 (Lecture Notes in Computer Science; Vuosikerta 12739 LNCS).

Tutkimustuotos: Konferenssiartikkeli › Tieteellinen › vertaisarvioitu

TY - GEN

T1 - Coverage-Based Summaries for RDF KBs

AU - Vassiliou, Giannis

AU - Troullinou, Georgia

AU - Papadakis, Nikos

AU - Stefanidis, Kostas

AU - Pitoura, Evangelia

AU - Kondylakis, Haridimos

N1 - Funding Information: This research project was supported by the Hellenic Foundation for Research and Innovation (H.F.R.I.) under the ?2nd Call for H.F.R.I. Research Projects to support Post-Doctoral Researchers? (iQARuS Project No. 1147). Publisher Copyright: © 2021, Springer Nature Switzerland AG. jufoid=62555

PY - 2021

Y1 - 2021

N2 - As more and more data become available as linked data, the need for efficient and effective methods for their exploration becomes apparent. Semantic summaries try to extract meaning from data, while reducing its size. State of the art structural semantic summaries, focus primarily on the graph structure of the data, trying to maximize the summary’s utility for query answering, i.e. the query coverage. In this poster paper, we present an algorithm, trying to maximize the aforementioned query coverage, using ideas borrowed from result diversification. The key idea of our algorithm is that, instead of focusing only to the “central” nodes, to push node selection also to the perimeter of the graph. Our experiments show the potential of our algorithm and demonstrate the considerable advantages gained for answering larger fragments of user queries.

AB - As more and more data become available as linked data, the need for efficient and effective methods for their exploration becomes apparent. Semantic summaries try to extract meaning from data, while reducing its size. State of the art structural semantic summaries, focus primarily on the graph structure of the data, trying to maximize the summary’s utility for query answering, i.e. the query coverage. In this poster paper, we present an algorithm, trying to maximize the aforementioned query coverage, using ideas borrowed from result diversification. The key idea of our algorithm is that, instead of focusing only to the “central” nodes, to push node selection also to the perimeter of the graph. Our experiments show the potential of our algorithm and demonstrate the considerable advantages gained for answering larger fragments of user queries.

U2 - 10.1007/978-3-030-80418-3_18

DO - 10.1007/978-3-030-80418-3_18

M3 - Conference contribution

AN - SCOPUS:85115847856

SN - 9783030804176

T3 - Lecture Notes in Computer Science

SP - 98

EP - 102

BT - The Semantic Web

A2 - Verborgh, Ruben

A2 - Dimou, Anastasia

A2 - Hogan, Aidan

A2 - d’Amato, Claudia

A2 - Tiddi, Ilaria

A2 - Bröring, Arne

A2 - Maier, Simon

A2 - Ongenae, Femke

A2 - Tommasini, Riccardo

A2 - Alam, Mehwish

PB - Springer

T2 - Extended Semantic Web Conference

Y2 - 6 June 2021 through 10 June 2021

ER -

Vassiliou G, Troullinou G, Papadakis N, Stefanidis K, Pitoura E, Kondylakis H. Coverage-Based Summaries for RDF KBs. julkaisussa Verborgh R, Dimou A, Hogan A, d’Amato C, Tiddi I, Bröring A, Maier S, Ongenae F, Tommasini R, Alam M, toimittajat, The Semantic Web: ESWC 2021 Satellite Events, Revised Selected Papers. Springer. 2021. s. 98-102. (Lecture Notes in Computer Science). doi: 10.1007/978-3-030-80418-3_18

Coverage-Based Summaries for RDF KBs

Abstrakti

Julkaisusarja

Conference

Rahoitus

Julkaisufoorumi-taso

!!ASJC Scopus subject areas

Pääsy asiakirjaan

Sormenjälki

Siteeraa tätä