Learning Commonalities in SPARQL - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

Learning Commonalities in SPARQL


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.
Fichier principal
Vignette du fichier
EGJ-ISWC-17.pdf (355.66 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01572691 , version 1 (08-08-2017)


  • HAL Id : hal-01572691 , version 1


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⟩
242 View
235 Download


Gmail Facebook X LinkedIn More