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. Categories and Subject Descriptors D.2.12 [Software]: Interoperability; I.2.4 [Artificial Intelligence]: Knowledge Representation Formalisms and Methods; D.2.8 [Software Engineering]: Metrics General Terms Mea...

• Type: Conference
• Year: 2005
• Where: KCAP
• Authors: Marc Ehrig, Jérôme Euzenat
• Keywords: KCAP 2005, Keywords Ontology Alignment, Knowledge Representation Formalisms And Methods, Ontology Matching Algorithms