<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Complex matching for multiple ontologies: an exploratory study</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Madalena Pav~ao</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Catia Pesquita</string-name>
          <email>clpesquita@ciencias.ulisboa.pt</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>LASIGE</institution>
          ,
          <addr-line>Faculdade de Ci</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>encias da Universidade de Lisboa</institution>
          ,
          <country country="PT">Portugal</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Complex matching, i.e., nding correspondences that go beyond equivalence and are able to capture more complex relationships between entities or sets of entities, is a recognized challenge (for a more in-depth overview see [1]). However, in multi-domain areas, there is a need to perform `holistic' matching - link multiple ontologies to address di erent perspectives of the underlying data, while maintaining the inherently distributed paradigm championed by the Semantic Web. This need motivates `compound mappings' involving more than two ontologies. A speci c case is the ternary compound mapping [2], for example, the HP class `broad forehead' is equivalent to an axiom obtained by relating PATO (`increased width') and UBERON (`forehead') classes, via an intersection. In this study, we explore compound matching involving multiple concepts from multiple ontologies.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>A compound mapping is a tuple &lt;Cs,[Ct0,...,Ctn],[Pt0,...,Ptn],M&gt;, where Cs is
a class from a source ontology, [Ct0,...,Ctn] and [Pt0,...,Ptn] are a set of target
classes extracted from multiple target ontologies and the set of properties that
stand between them, while M is a mapping relation established between the
source class and the expression composed by the set of target classes and
properties. For our purposes, we are restricting our approach to nding mappings
where M is an equivalence, and we are simplifying our goal to just nding the
set of target classes. Our compound matching algorithm is based on nding
partial lexical matches between word sequences in the source class labels and full
labels of target classes. The algorithms for compound alignment were developed
within the AgreementMakerLight (AML) system [3] and use hash map-based
data structures to improve scalability.</p>
      <p>
        We evaluated our algorithm using four test cases: (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) HP as source, UBERON
and PATO as targets; (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) HP as source, UBERON, PATO and GO as targets;
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) MP as source, UBERON and PATO as targets; (4) MP as source, UBERON,
PATO and GO as targets1. The reference alignments for each task were generated
      </p>
      <p>
        Madalena Pava~o and Catia Pesquita
by extracting all the Equivalent Classes Axioms of MP and HP OWL les with
OWL API. For each ontology we created two references: (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) UB-PT: containing
mappings that employ classes from the UBERON and/or PATO ontologies; (
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
UB-PT-GO: containing all mappings that employ the UBERON and/or PATO
and/or GO ontologies. Note that these are just partial alignments, since they
only cover 39%of the classes in HP and 28.7% in MP.
      </p>
      <p>In our evaluation (shown in Table 1) we have considered partial mappings as
positive2. The MP tasks had a better performance than HP, and for MP there
was a marked di erence between the UB-PT and UB-PT-GO, with the former
having an improvement of over 30% in f-measure.</p>
    </sec>
    <sec id="sec-2">
      <title>Conclusions</title>
      <p>This exploratory study highlights the di culties in performing holistic
matching, which range from scalability issues to the inherent increased complexity of
the task. Recent evaluation of complex matching approaches revealed that all
techniques produced f-measures below 20% [1]. Furthermore, building reference
alignments for compound matching is a standing challenge, and the reference
alignments we built can only be considered partial references. We envision
several future work endeavors in this area, ranging from more complex lexical
approaches to approaches richer in semantics that are able to capture property
restrictions to reproduce the full equivalence axiom.</p>
      <p>Acknowledgments This work has been supported by the Fundac~ao da Ci^encia
e Tecnologia through funding of LaSIGE Research Unit, ref.UID/CEC/00408/2013
and by the project SMiLaX (PTDC/EEI-ESS/4633/2014).
2 Mappings that have at least one class in common with the classes in the reference</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Thieblin</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Haemmerle</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hernandez</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Trojahn</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Task-oriented complex ontology alignment: Two alignment evaluation sets</article-title>
          .
          <source>In: European Semantic Web Conference</source>
          , Springer (
          <year>2018</year>
          )
          <volume>655</volume>
          {
          <fpage>670</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Oliveira</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pesquita</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Improving the interoperability of biomedical ontologies with compound alignments</article-title>
          .
          <source>Journal of biomedical semantics 9(1)</source>
          (
          <year>2018</year>
          )
          <fpage>1</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Faria</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pesquita</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Santos</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Palmonari</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cruz</surname>
            ,
            <given-names>I.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Couto</surname>
            ,
            <given-names>F.M.:</given-names>
          </string-name>
          <article-title>The agreementmakerlight ontology matching system</article-title>
          .
          <source>In: On the Move to Meaningful Internet Systems: OTM 2013 Conferences</source>
          , Berlin, Heidelberg, Springer (
          <year>2013</year>
          )
          <volume>527</volume>
          {
          <fpage>541</fpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>