Relaxed Precision and Recall for Ontology Matching - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2005

Relaxed Precision and Recall for Ontology Matching


In order to evaluate the performance of ontology matching algorithms it is necessary to confront them with test ontologies and to compare the results. The most prominent criteria are precision and recall originating from information retrieval. However, it can happen that an alignment be very close to the expected result and another quite remote from it, and they both share the same precision and recall. This is due to the inability of precision and recall to measure the closeness of the results. To overcome this problem, we present a framework for generalizing precision and recall. This framework is instantiated by three different measures and we show in a motivating example that the proposed measures are prone to solve the problem of rigidity of classical precision and recall.
Fichier principal
Vignette du fichier
paper5.pdf (224.52 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00922279 , version 1 (25-12-2013)


  • HAL Id : hal-00922279 , version 1


Marc Ehrig, Jérôme Euzenat. Relaxed Precision and Recall for Ontology Matching. Proc. K-Cap 2005 workshop on Integrating ontology, Oct 2005, Banff, Canada. pp.25-32. ⟨hal-00922279⟩
610 View
951 Download


Gmail Facebook X LinkedIn More