Dynamically Time-Capped Possibilistic Testing of SubClassOf Axioms Against RDF Data to Enrich Schemas - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Dynamically Time-Capped Possibilistic Testing of SubClassOf Axioms Against RDF Data to Enrich Schemas

Résumé

Axiom scoring is a critical task both for the automatic en-richment/learning and for the automatic validation of knowledge bases and ontologies. We designed and developed an axiom scoring heuristic based on possibility theory, which aims at overcoming some limitations of scoring heuristics based on statistical inference and taking into account the open-world assumption of the linked data on the Web. Since computing the possibilistic score can be computationally quite heavy for some candidate axioms, we propose a method based on time capping to alleviate the computation of the heuristic without giving up the precision of the scores. We evaluate our proposal by applying it to the problem of testing SubClassOf axioms against the DBpedia RDF dataset.
Fichier principal
Vignette du fichier
k-cap2015.pdf (499.94 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01187384 , version 1 (26-08-2015)

Identifiants

Citer

Andrea G. B. Tettamanzi, Catherine Faron Zucker, Fabien Gandon. Dynamically Time-Capped Possibilistic Testing of SubClassOf Axioms Against RDF Data to Enrich Schemas. The 8th International Conference on Knowledge Capture, K-CAP 2015, Oct 2015, Palisades, NY, United States. ⟨10.1145/2815833.2815835⟩. ⟨hal-01187384⟩
362 Consultations
187 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More