• Aucun résultat trouvé

Is my ontology matching system similar to yours?

N/A
N/A
Protected

Academic year: 2022

Partager "Is my ontology matching system similar to yours?"

Copied!
2
0
0

Texte intégral

(1)

Is my ontology matching system similar to yours?

Ernesto Jim´enez-Ruiz, Bernardo Cuenca Grau, Ian Horrocks Department of Computer Science, University of Oxford, Oxford UK

Abstract. In this paper we extend the evaluation of the OAEI 2012 Large BioMed track, which involves the matching of the semantically rich ontologies FMA, NCI and SNOMED CT. Concretely, we report about the differences and similarities among the mappings computed by the participant ontology matching systems.

1 Introduction

The quality of the mappings computed by an ontology matching system in the Ontology Alignment Evaluation Initiative (OAEI) [2, 1] is typically measured in terms of preci- sion and recall with respect to a reference set of mappings. Additionally, the OAEI also evaluates the coherence of the computed mappings [1].

However, the differences and similarities among the mappings computed by differ- ent systems have often been neglected in the OAEI.1In this paper we provide a more fine-grained comparison among the matching systems participating in the OAEI 2012 Large BioMed track;2concretely (i) we have harmonised (i.e. voted) the computed map- ping sets, and (ii) we provide a graphical representation of the similarity of these sets.

2 Mapping harmonization

We have considered the mappings voted (i.e. included in the output) by at least one ontology matching system. Figure 1 shows the harmonization (i.e. voting) results for the FMA-NCI and FMA-SNOMED matching problems. Mappings have received at most 11 and 8 votes (i.e. number of participating systems3), respectively. For example, in the FMA-NCI matching problem, 3,719 mappings have been voted by at least 2 systems.

Figure 1 also shows the evolution of F-score, Precision and Recall for the different harmonized mapping sets. As expected the maximum recall (respectively precision) is reached with the minimum (respectively maximum) number of votes. For example, the maximum recall in the FMA-SNOMED problem is 0.81, which shows the difficulty of identifying correct mappings in this matching problem.

The harmonized mapping sets with the best trade-off between precision and recall have been selected as the representative mapping sets of the participating ontology matching systems. For the FMA-NCI matching problem we have selected the mappings sets with (at least) 3, 4 and 5 votes, while in the FMA-SNOMED matching problem we have selected the sets with (at least) 2 and 3 votes (see dark-grey bars in Figure 1).

This research was financed by the Optique project with the grant agreement FP7-318338.

1As far as we know, only in the 2007 Anatomy track some effort was done in this line:http:

//oaei.ontologymatching.org/2007/results/anatomy/

2Results available at:http://www.cs.ox.ac.uk/isg/projects/SEALS/oaei/

3Systems with several variants have only been considered once in the voting process.

(2)

0 0.2 0.4 0.6 0.8 1 1.2

1 2 3 4 5 5 7 8 9 10 11

Score Number of mappings

Number of votes 11,160

3,719

3,074 2,862 2,739 2,563 2,420 2,292 2,077

1,630 812 Size Precision Recall F-measure

0 0.2 0.4 0.6 0.8 1 1.2

1 2 3 4 5 5 7 8

Score Number of mappings

Number of votes 17,020

7,997 6,592

4,218 2,846

2,052 1,610

1,002 Size Precision Recall F-measure

Fig. 1: Harmonisation in the FMA-NCI (left) and FMA-SNOMED (right) problems

0 0.10 0.20 0.30 0.40

0 0.10 0.20 0.30 0.40

Jaccard distance

Jaccard distance LogMap LogMap-noe

LogMapLt

GOMMA GOMMA-Bk ServOMap

ServOMapL YAM++

UMLS UMLSL

UMLSA Vote3

Vote4 Vote5

0 0.10 0.20 0.30 0.40 0.50 0.60

0 0.10 0.20 0.30 0.40 0.50 0.60 0.70 0.80

Jaccard distance

Jaccard distance

LogMap LogMap-noe

LogMapLt GOMMA

GOMMA-Bk

ServOMap ServOMapL YAM++

UMLS UMLSL

UMLSA

Vote2

Vote3

Fig. 2: Mapping similarity in the FMA-NCI (left) and FMA-SNOMED (right) problems

3 Mapping similarity among systems

We have compared the similarity among (i) the representative mapping sets from the harmonisation (see Section 2), (ii) the UMLS-based reference mappings of the track, and (iii) the mapping sets computed by the top-8 ontology matching systems in the FMA-NCI and FMA-SNOMED matching problems [1]. To this end we have calculated the jaccard distance(|MA∪ MB| − |MA∩ MB|)/|MA∪ MB|, which ranges from 0 (the same) to 1 (different), between each pair (MAandMB) of the mapping sets from (i)-(iii), and represented such distances in a two-dimensional scatterplot (see Figure 2).

System names which are distant to each other indicate that their computed mappings differ to a large degree. For example, in Figure 2 (right), the mappings computed by LogMapLt and GOMMA are very different with respect to the mappings computed by other systems, as well as with respect to the harmonized and reference mapping sets.

References

1. Aguirre, J., et al.: Results of the Ontology Alignment Evaluation Initiative 2012. In: Ontology Matching Workshop. Vol-946 of CEUR Workshop Proceedings (2012)

2. Euzenat, J., Meilicke, C., Stuckenschmidt, H., Shvaiko, P., Trojahn, C.: Ontology alignment evaluation initiative: Six years of experience. J. Data Sem. 15, 158–192 (2011)

Références

Documents relatifs

Furthermore we present the results obtained in the OAEI 2011.5 campaign for this track and we propose a new reference alignment based on the harmonisation of the outputs of

[r]

We observe the impact of ontology refactoring, based on detection of name patterns in the ontology structure, on the results of ontology matching.. Results of our experiment

Decisions of the eighth session of the Committee (2013) Decisions 8.COM Decisions of the seventh session of the Committee (2012) Decisions 7.COM Decisions of the sixth session of

We describe and evaluate a semi-automatic method for mapping the large lexical network WordNet 3.0 (WN) to BFO 2.0 exploiting an existing mapping between WN and the KYOTO

In this paper, we propose a nonlocal model for linear steady Stokes equation with no-slip boundary condition.. The main idea is to use volume constraint to enforce the no-slip

Let (M, J) be a compact, connected almost complex manifold, endowed with the action of a connected compact Lie group G, and let L be a positive G-equivariant line bundle on M.. One

The purpose of this study is to examine the gaming practices of Inuit youth to determine what evidence of learning they demonstrate. It aims to investigate gaming as a