<!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>Pattern-Guided Association Rule Mining for Complex Ontology Alignment</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>LASIGE</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Dep. Informatica</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Faculdade de Ci</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>encias</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Universidade de Lisboa</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Portugal</string-name>
        </contrib>
      </contrib-group>
      <abstract>
        <p>Aligning real-world ontology pairs often requires establishing complex correspondences, as conceptual di erences between them may be too profound to bridge with simple equivalence correspondences. Yet, most ontology alignment algorithms are restricted to nding simple equivalences between ontology entities. This work presents a suite of novel algorithms for Complex Ontology Alignment (COA) that rely on a targeted application of Association Rule Mining (ARM) to known complex alignment patterns. This approach reduces the ARM search space, and enables the application of tailored semantic ltering algorithms for re ning the mappings. We evaluated our approach using a pattern-oriented manual method, which yielded a global weighted precision of 75%, but revealed our approach was unable to nd mappings for some of the patterns present in the reference. On the other hand, our approach found several mappings for patterns not present in the reference with high weighted precision, highlighting the importance of establishing evaluation metrics that consider varying degrees of correctness while being fully automated.</p>
      </abstract>
      <kwd-group>
        <kwd>Ontology Matching</kwd>
        <kwd>Ontology Alignment</kwd>
        <kwd>Complex Ontology Matching</kwd>
        <kwd>Association Rule Mining</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Ontology alignment is critical to address the semantic heterogeneity problem, as
it nds correspondences that enable integrating data across the Semantic Web.
One of its biggest challenges is that ontology schemas often di er conceptually,
making it necessary to establish complex correspondences. A complex
correspondence is an ontology mapping where at least one of the mapped entities is an
expression, rather than a simple ontology entity. The expressions used in
complex mappings include restrictions (e.g. 8x; y; o1 : M arriedP erson(x) o2 :
hasSpouse(x; y) ^ o2 : P erson(y)) and constructions using logical operatores
(e.g. 8xo1 : M other(x) o2 : P arent(x) ^ o2 : W oman(x)).</p>
      <p>
        The relevance of the Complex Ontology Alignment (COA) sub- eld has been
acknowledged by the Ontology Alignment Evaluation Initiative (OAEI) 1 who
Copyright © 2021 for this paper by its authors. Use permitted under Creative
Commons License Attribution 4.0 International (CC BY 4.0).
1 http://oaei.ontologymatching.org
introduced a Complex track in 2018 [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. As of 2020, only three out of twelve
participating systems were able to produce complex mappings (AMLC [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], AROA [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]
and CANARD [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]) and their performance was very modest in comparison with
the results of simple matching tracks [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. The strategies employed by these
systems can be divided into two categories: lexical and instance-based approaches.
AMLC employs a lexical approach, which is inherently limited to nding the
subset of complex mappings where there is lexical similarity between all entities
mapped. CANARD, AROA and this work employ instance-based approaches,
which use statistical and pattern mining techniques over a dataset of individuals
shared (or mapped) between the two ontologies. AROA uses an Association Rule
Mining (ARM) algorithm, FP-Growth [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], over a transaction database derived
from the instance-level triples shared by two ontologies, thus demonstrating how
a complex ontology alignment dataset can be transformed into a traditional
ARM problem. Prede ned complex alignment patterns [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] are then used to lter
the generated association rules and produce complex ontology mappings.
      </p>
      <p>ARM exploring a shared set of instances is a promising approach. However,
the fact that we have prior knowledge of the complex alignment patterns we
want to nd makes it ine cient to use a \catch-all" ARM algorithm to perform
an exhaustive search for frequent itemsets, and only use the knowledge of the
patterns a posteriori to lter the rules. Therefore, we propose to invert this
paradigm, by using prede ned complex alignment patterns to guide ARM. This
e ectively reduces the search space and allows the application of semantic-based
ltering algorithms tailored to each kind of pattern, to select and re ne the most
relevant mappings.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Algorithms</title>
      <p>Our ontology alignment approach consists of the following steps:
1. An initial ontology loading step retrieves the set of shared individuals
between the two ontologies and organises the ontology information (types,
relations and property values of each individual, ranges and domains of the
properties and hierarchical relations between classes) in hash-tables.
2. For each complex alignment pattern, an individual pattern matching
algorithm iterates through the set of shared individuals, and, for each individual,
it searches the hash-table data structures containing the relevant data for
the targeted alignment pattern. For each mapping candidate found, we
increment the support (i.e., the frequency) of the source and target entities
in the mapping and the support of the mapping itself (i.e., the fraction of
shared individuals that have both the source and target entities).
3. A common ARM matching algorithm is then invoked by each pattern
matching algorithm to lter mapping candidates by support and con dence,
therefore extracting association rules.
4. Filtering algorithms select which of the candidate mappings to include in
the nal alignment, excluding redundant mappings and con icting mappings
with lower con dence. An aggregator algorithm combines mappings for the
same entity into a single mapping using logical operators, such as \AND"
and \OR".</p>
      <p>Our algorithms cover eight distinct complex patterns, from which seven were
found in the cmt conf erence dataset (see Table 1). Additionally, they can
produce combinations of these patterns through disjunction and conjunction.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Evaluation</title>
      <p>
        We integrated our algorithms in the ontology matching system AMLC [
        <xref ref-type="bibr" rid="ref1 ref2">1,2</xref>
        ], and
assessed their performance in the cmt conf erence alignment 2 by manually
classifying the mappings according to a rating scale consisting of the following
ve categories with associated scores:
      </p>
      <p>Correct [1.0]: The mapping is formally correct (regardless of whether it is
present in the reference alignment).</p>
      <p>Nearly correct [0.75]: Only minor corrections necessary (e.g., alter the
mapping relation type or substitute a class for its sub- or super-class).
Plausible [0.5]: The mapping seems sensible and no information in the
ontologies or reference alignment contradicts it.</p>
      <p>Implausible [0.25]: The mapping seems incorrect and is likely derived from
biases in the dataset, but no information in the ontologies or reference
alignment contradicts it.</p>
      <p>False [0.0]: The mapping is contradictory to the reference alignment and/or
ontologies.</p>
      <p>Our approach allows for ne tuning of matchers and lters, speci c to each
pattern, yielding precise results (Table 1). While it was unable to nd mappings
for some of the patterns present in the reference, it found several mappings for
patterns not present in the reference with high weighted precision.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Conclusions</title>
      <p>
        We developed a novel complex ontology matching method based on
patternguided ARM, which represents a paradigm shift by making used of the alignment
patterns to steer, rather than lter, the ARM process. Our manual evaluation
revealed that the majority of mappings we found are correct or nearly correct, even
if not present in the reference alignment. These results highlight the importance
of establishing evaluation metrics that consider varying degrees of correctness
while being fully automated. Going forward we will investigate the
computational performance of our approach versus classical ARM, and extend the types
of patterns it captures.
2 Available at: http://oaei.ontologymatching.org/2020/complex/index.html#
popconf; Reference alignments provided by Thieblin et al. [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]
Acknowledgments This work was supported by FCT through the LASIGE
Research Unit (UIDB/00408/2020 and UIDP/00408/2020). It was also partially
supported by the KATY project which has received funding from the European
Union's Horizon 2020 research and innovation program under grant agreement
No 101017453.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <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>
          . pp.
          <volume>527</volume>
          {
          <fpage>541</fpage>
          . Springer Berlin Heidelberg, Berlin, Heidelberg (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <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>Tervo</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Couto</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cruz</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>AML and AMLC results for OAEI 2019</article-title>
          . vol.
          <volume>2536</volume>
          , pp.
          <volume>101</volume>
          {
          <issue>106</issue>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3. Han,
          <string-name>
            <given-names>J</given-names>
            .,
            <surname>Pei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Yin</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y.</surname>
          </string-name>
          :
          <article-title>Mining frequent patterns without candidate generation</article-title>
          .
          <source>In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data</source>
          . p.
          <volume>1</volume>
          {
          <fpage>12</fpage>
          . SIGMOD '
          <volume>00</volume>
          ,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery (
          <year>2000</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Pour</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Algergawy</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Amini</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Faria</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fundulaki</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Harrow</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hertling</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jimenez-Ruiz</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jonquet</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Karam</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          , et al.:
          <article-title>Results of the Ontology Alignment Evaluation Initiative 2020</article-title>
          . vol.
          <volume>2788</volume>
          , pp.
          <volume>92</volume>
          {
          <fpage>138</fpage>
          .
          <string-name>
            <surname>CEUR-WS</surname>
          </string-name>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Ritze</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Meilicke</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Svab-Zamazal</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stuckenschmidt</surname>
          </string-name>
          , H.:
          <article-title>A pattern-based ontology matching approach for detecting complex correspondences</article-title>
          . vol.
          <volume>551</volume>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Thieblin</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cheatham</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Santos</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Svab-Zamazal</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>The First Version of the OAEI Complex Alignment Benchmark</article-title>
          . In: International Semantic Web Conference. vol.
          <volume>2180</volume>
          . Springer (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <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>
          . In: Gangemi,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Navigli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Vidal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.E.</given-names>
            ,
            <surname>Hitzler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Troncy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Hollink</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Tordai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Alam</surname>
          </string-name>
          , M. (eds.)
          <article-title>The Semantic Web</article-title>
          . pp.
          <volume>655</volume>
          {
          <fpage>670</fpage>
          . Springer International Publishing,
          <string-name>
            <surname>Cham</surname>
          </string-name>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <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>Trojahn</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>CANARD complex matching system: results of the 2019 OAEI evaluation campaign</article-title>
          . vol.
          <volume>2536</volume>
          , pp.
          <volume>114</volume>
          {
          <issue>122</issue>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hitzler</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>AROA Results for 2020 OAEI</article-title>
          . vol.
          <volume>2788</volume>
          , pp.
          <volume>161</volume>
          {
          <issue>167</issue>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>