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

Abstract : 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.
Type de document :
Communication dans un congrès
The 8th International Conference on Knowledge Capture, K-CAP 2015, Oct 2015, Palisades, NY, United States. <10.1145/2815833.2815835>
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-01187384
Contributeur : Catherine Faron Zucker <>
Soumis le : mercredi 26 août 2015 - 16:10:32
Dernière modification le : lundi 18 juillet 2016 - 14:44:55
Document(s) archivé(s) le : vendredi 27 novembre 2015 - 11:03:20

Fichier

k-cap2015.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

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>

Partager

Métriques

Consultations de
la notice

298

Téléchargements du document

97