Learning Commonalities in SPARQL

Abstract : Finding the commonalities between descriptions of data or knowledge is a foundational reasoning problem of Machine Learning. It was formalized in the early 70's as computing a least general generalization (lgg) of such descriptions. We revisit this well-established problem in the SPARQL query language for RDF graphs. In particular, and by contrast to the literature, we address it for the entire class of conjunc-tive SPARQL queries, a.k.a. Basic Graph Pattern Queries (BGPQs), and crucially, when background knowledge is available as RDF Schema ontological constraints, we take advantage of it to devise much more precise lggs, as our experiments on the popular DBpedia dataset show.
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/hal-01572691
Contributor : François Goasdoué <>
Submitted on : Tuesday, August 8, 2017 - 11:09:43 AM
Last modification on : Thursday, February 7, 2019 - 3:02:10 PM

File

EGJ-ISWC-17.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01572691, version 1

Citation

Sara El Hassad, François Goasdoué, Hélène Jaudoin. Learning Commonalities in SPARQL. International Semantic Web Conference (ISWC), Oct 2017, Vienna, Austria. ⟨hal-01572691⟩

Share

Metrics

Record views

379

Files downloads

196