Knowledge-Based Matching of $n$-ary Tuples - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2020

Knowledge-Based Matching of $n$-ary Tuples

Pierre Monnin
Miguel Couceiro
Amedeo Napoli
Adrien Coulet


An increasing number of data and knowledge sources are accessible by human and software agents in the expanding Semantic Web. Sources may differ in granularity or completeness, and thus be complementary. Consequently, they should be reconciled in order to unlock the full potential of their conjoint knowledge. In particular, units should be matched within and across sources, and their level of relatedness should be classified into equivalent, more specific, or similar. This task is challenging since knowledge units can be heterogeneously represented in sources (e.g., in terms of vocabularies). In this paper, we focus on matching $n$-ary tuples in a knowledge base with a rule-based methodology. To alleviate heterogeneity issues, we rely on domain knowledge expressed by ontologies. We tested our method on the biomedical domain of pharmacogenomics by searching alignments among 50,435 n-ary tuples from four different real-world sources. Results highlight noteworthy agreements and particularities within and across sources.
Fichier principal
Vignette du fichier
iccs-paper.pdf (359.16 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02493067 , version 1 (23-02-2021)



Pierre Monnin, Miguel Couceiro, Amedeo Napoli, Adrien Coulet. Knowledge-Based Matching of $n$-ary Tuples. ICCS 2020 - 25th International Conference on Conceptual Structures, Sep 2020, Bolzano / Virtual, Italy. pp.48-56, ⟨10.1007/978-3-030-57855-8_4⟩. ⟨hal-02493067⟩
168 View
223 Download



Gmail Facebook X LinkedIn More