Redescription mining for learning definitions and disjointness axioms in Linked Open Data - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

Redescription mining for learning definitions and disjointness axioms in Linked Open Data

Abstract

In this article, we present an original use of Redescription Mining (RM) for discovering definitions of classes and incompatibility (disjointness) axioms between classes of individuals in the web of data. RM is aimed at mining alternate descriptions from two datasets related to the same set of individuals. We reuse this process for providing definitions in terms of necessary and sufficient conditions to categories in DBpedia. Firstly, we recall the basics of redescription mining and make precise the principles of our definitional process. Then we detail experiments carried out on datasets extracted from DBpedia. Based on the output of the experiments, we discuss the strengths and the possible extensions of our approach.
Fichier principal
Vignette du fichier
ICCS_2019_paper_27.pdf (433.44 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-02170763 , version 1 (02-07-2019)

Identifiers

  • HAL Id : hal-02170763 , version 1

Cite

Justine Reynaud, Yannick Toussaint, Amedeo Napoli. Redescription mining for learning definitions and disjointness axioms in Linked Open Data. ICCS 2019 - 24th International Conference on Conceptual Structures, Jul 2019, Marburg, Germany. ⟨hal-02170763⟩
63 View
247 Download

Share

Gmail Mastodon Facebook X LinkedIn More