Learning Commonalities in RDF - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Learning Commonalities in RDF

Résumé

Finding the commonalities between descriptions of data or knowledge is a foundational reasoning problem of Machine Learning introduced in the 70's, which amounts to computing a least general generalization (lgg) of such descriptions. It has also started receiving consideration in Knowlegge Representation from the 90's, and recently in the Semantic Web field. We revisit this problem in the popular Resource Description Framework (RDF) of W3C, where descriptions are RDF graphs, i.e., a mix of data and knowledge. Notably, and in contrast to the literature, our solution to this problem holds for the entire RDF standard, i.e., we do not restrict RDF graphs in any way (neither their structure nor their semantics based on RDF entailment, i.e., inference) and, further, our algorithms can compute lggs of small-to-huge RDF graphs.
Fichier principal
Vignette du fichier
EGJ-ESWC17-paper.pdf (354.23 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01485862 , version 1 (09-03-2017)
hal-01485862 , version 2 (14-04-2017)
hal-01485862 , version 3 (26-04-2017)

Identifiants

  • HAL Id : hal-01485862 , version 3

Citer

Sara El Hassad, François Goasdoué, Hélène Jaudoin. Learning Commonalities in RDF. Extended Semantic Web Conference (ESWC), May 2017, Portoroz, Slovenia. ⟨hal-01485862v3⟩
616 Consultations
494 Téléchargements

Partager

Gmail Facebook X LinkedIn More