<!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>Results of CANARD in OAEI 2020?</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Elodie Thieblin</string-name>
          <email>elodie.thieblin@logilab.fr</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ollivier Haemmerle</string-name>
          <email>ollivier.haemmerle@irit.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Cassia Trojahn</string-name>
          <email>cassia.trojahn@irit.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>IRIT &amp; Universite de Toulouse 2 Jean Jaures</institution>
          ,
          <addr-line>Toulouse</addr-line>
          ,
          <country country="FR">France</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Logilab</institution>
          ,
          <country country="FR">France</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper presents the results from the CANARD system in the OAEI 2020 campaign. CANARD is a system able to generate complex alignments. It is based on the notion of competency questions for alignment, as a way of expressing user needs. The system has participated in tracks where instances are available (Populated Conference, Populated Geolink, Populated Enslaved and Taxon datasets). This is the third participation of CANARD in the OAEI campaigns.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>1.1</p>
    </sec>
    <sec id="sec-2">
      <title>Settings de nition</title>
      <p>
        Following the evaluation made in [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], the number of support instances was set
to 2 instead of 10 last year to improve the runtime. The levenshtein similarity
threshold was set to 0.4 like last year.
? Copyright © 2020 for this paper by its authors. Use permitted under Creative
Commons License Attribution 4.0 International (CC BY 4.0).
1.2
      </p>
    </sec>
    <sec id="sec-3">
      <title>Adaptations made for the evaluation</title>
      <p>
        Automatic generation of CQAs OAEI tracks do not cover CQAs i.e., the
CQAs can not be given as input in the evaluation. We extended last year's query
generator so that it can output binary queries. The query generator now produces
three types of SPARQL queries: Classes, Properties and Property-Value pairs.
Classes For each owl:Class populated with at least one instance, a SPARQL
query is created to retrieve all the instances of this class. If &lt;o1#class1&gt; is a
populated class of the source ontology, the following query is created:
SELECT DISTINCT ?x WHERE f?x a &lt;o1#class1&gt;.g
Properties For each owl:ObjectProperty or owl:Dataproperty with at least one
instantiation in the source knowledge base, a SPARQL query is created to
retrieve all instantiations of this property. If &lt;o1#property1&gt; is an instantiated
property of the source ontology, the following query is created:
SELECT DISTINCT ?x ?y WHERE f?x &lt;o1#property1&gt; ?y.g
Property-Value pairs Inspired by the approaches of [
        <xref ref-type="bibr" rid="ref1 ref2 ref5">1,2,5</xref>
        ], we create SPARQL
queries of the form
{ SELECT DISTINCT ?x WHERE f?x &lt;o1#property1&gt; &lt;o1#Value1&gt;.g
{ SELECT DISTINCT ?x WHERE f&lt;o1#Value1&gt; &lt;o1#property1&gt; ?x.g
{ SELECT DISTINCT ?x WHERE f?x &lt;o1#property1&gt; "Value".g
These property-value pairs are computed as follow: for each property (object or
data property), the number of distinct object and subject values are retrieved.
If the ratio of these two numbers is over a threshold (arbitrarily set to 30)
and the smallest number is smaller than a threshold (arbitrarily set to 20), a
query is created for each of the less than 20 values. For example, if the property
&lt;o1#property1&gt; has 300 di erent subject values and 3 di erent object values
("Value1", "Value2", "Value3"), the ratio jsubjectj=jobjectj = 300=3 &gt; 30 and
jobjectj = 3 &lt; 20. The 3 following queries are created as CQAs:
{ SELECT DISTINCT ?x WHERE f?x &lt;o1#property1&gt; "Value1".g
{ SELECT DISTINCT ?x WHERE f?x &lt;o1#property1&gt; "Value2".g
{ SELECT DISTINCT ?x WHERE f?x &lt;o1#property1&gt; "Value3".g
The threshold on the smallest number ensures that the property-value pairs
represent a category. The threshold on the ratio ensures that properties represent
categories and not properties with few instantiations.
      </p>
      <p>Implementation adaptations In the initial version of the system, Fuseki
server endpoints are given as input. For the SEALS evaluation, we embedded a
Fuseki server inside the matcher. The ontologies are downloaded from the SEALS
repository, then uploaded in the embedded Fuseki server before the matching
process can start. This downloading-uploading phase takes time, in particular
when dealing with large les.</p>
      <p>The CANARD system in the SEALS package is available at http://doi.
org/10.6084/m9.figshare.7159760.v2. The generated alignments over the datasets
in which CANARD performed are available at:
{ Populated Conference: http://oaei.ontologymatching.org/2020/results/
complex/popconf/results_conference.zip
{ Populated GeoLink: http://oaei.ontologymatching.org/2020/results/
complex/popgeolink/popgeolink_results_2020.zip
{ Populated Enslaved: http://oaei.ontologymatching.org/2020/results/
complex/popenslaved/popenslaved_results_2020.zip
{ Taxon: http://oaei.ontologymatching.org/2020/results/complex/taxon/
results_taxon.zip
2</p>
      <sec id="sec-3-1">
        <title>Results</title>
        <p>Please refer to http://oaei.ontologymatching.org/2020/results/complex
for the results of CANARD in the OAEI 2020 campaign.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>2.1 Populated Conference</title>
      <p>Two datasets were used in the Populated Conference subtrack, one with more
instances than the other. CANARD could perform all the matching tasks in the
smaller dataset but timed out on 16 out of the 20 oriented pairs. This highlights
one of CANARD's limitations : scalability.</p>
      <p>For this reason, the coverage score is much lower on the large dataset than
on the small one. While merging the results of all matchers by taking their best
run (original, small or large dataset), CANARD obtains the best coverage score.
It is the only evaluated matcher with a Coverage score higher than that of the
reference simple alignment (ra1).</p>
    </sec>
    <sec id="sec-5">
      <title>2.2 Populated Geolink</title>
      <p>CANARD achieved the best relaxed-precision score (0.89) and the second best
relaxed-recall score (0.54). This score however does not consider the semantics
of the output correspondence. Most systems achieved a high relaxed precision
score. Because of the automatic generation of CQAs, many correspondences of
the form 9gbo:hasPlatformType.fXg gmo:Platform, where X is a platform type
were found.</p>
    </sec>
    <sec id="sec-6">
      <title>2.3 Populated Enslaved</title>
      <p>CANARD performed the lowest in this track out of the three evaluated complex
matchers. On the enslaved-wikidata oriented pair of ontologies, CANARD found
many instance links for each support answer. These links were found with literal
comparison on two instances, a generic method which brings a lot of errors on
a dataset with many literal information (such as dates or values). In the case of
binary CQAs, as CANARD tries to nd a property path between each aligned
entity, the runtime exploded and had to be stopped. This shows a major aw in
CANARD that should be xed.
2.4</p>
    </sec>
    <sec id="sec-7">
      <title>Taxon</title>
      <p>CANARD has output much more correspondences than last year. A recurring
pattern was found in the correspondences: an object property from Taxref or
Agrovoc is aligned to a chain of agronomicTaxon:hasHigherRank and
agronomicTaxon:hasLowerRank properties. This lowered the precision score in comparison
with last year's. This can be explained by:
{ Wrong instance linking based on label matching regardless of the language
(e.g., a plant taxon matched to a habitat)
{ The computation of all possible links between the two matched instances in
the target knowledge-base
{ If a path is found between two matched instances, it gets a default con dence
value of 0.5. If a better path is found (a path with a lexical similarity to the
source property), it gets a higher value and the default path are ltered. In
this case, no better path was found so all correspondences were kept.</p>
      <p>The recall score is also lower as last year's because the system was set to
use only 2 support instances this year. As the instances are not homogeneously
described in each dataset, more support instances mean more chances of nding
one in the target dataset which instantiate the initial knowledge need. However,
CANARD still achieves the best Coverage scores.
3</p>
      <sec id="sec-7-1">
        <title>General comments</title>
        <p>CANARD relies on common instances between the ontologies. It works best
with aligned instances as it will try to nd lexically similar entities otherwise.
Hence, when such instances are not available, the approach is not able to
generated complex correspondences. Furthermore, CANARD is need-oriented and
requires a set competency questions to guide the matching process. Here, these
\questions" have been automatically generated based on a set of patterns.</p>
        <p>CANARD's runtime is extremely long. It depends (among other things) on
the performance of the SPARQL endpoint it interrogates and the presence (or
not) of equivalent links.</p>
        <p>However, even with generated queries (instead of user input CQAs) it obtains
some of the best coverage scores.
4</p>
      </sec>
      <sec id="sec-7-2">
        <title>Conclusions</title>
        <p>This paper presented the adapted version of the CANARD system and its
preliminary results in the OAEI 2020 campaign. This year, we have been participated
in Populated Conference, Populated GeoLink, Populated Enslaved and Taxon
track, in which ontologies are populated with common instances.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Parundekar</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Knoblock</surname>
            ,
            <given-names>C.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ambite</surname>
            ,
            <given-names>J.L.</given-names>
          </string-name>
          :
          <article-title>Linking and building ontologies of linked data</article-title>
          .
          <source>In: ISWC</source>
          . pp.
          <volume>598</volume>
          {
          <fpage>614</fpage>
          . Springer (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Parundekar</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Knoblock</surname>
            ,
            <given-names>C.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ambite</surname>
            ,
            <given-names>J.L.</given-names>
          </string-name>
          :
          <article-title>Discovering concept coverings in ontologies of linked data sources</article-title>
          .
          <source>In: ISWC</source>
          . pp.
          <volume>427</volume>
          {
          <fpage>443</fpage>
          . Springer (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Thieblin</surname>
          </string-name>
          , E.:
          <article-title>Automatic Generation of Complex Ontology Alignments. (Generation automatique d'alignements complexes d'ontologies)</article-title>
          .
          <source>Ph.D. thesis</source>
          , Paul Sabatier University, Toulouse, France (
          <year>2019</year>
          ), https://tel.archives-ouvertes.fr/ tel-02735724
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <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>Generating expressive correspondences: An approach based on user knowledge needs and a-box relation discovery</article-title>
          . In: Pan,
          <string-name>
            <given-names>J.Z.</given-names>
            ,
            <surname>Tamma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.A.M.</given-names>
            ,
            <surname>d'Amato</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Janowicz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            ,
            <surname>Fu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Polleres</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Seneviratne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            ,
            <surname>Kagal</surname>
          </string-name>
          ,
          <string-name>
            <surname>L</surname>
          </string-name>
          . (eds.)
          <source>The Semantic Web - ISWC 2020 - 19th International Semantic Web Conference</source>
          , Athens, Greece, November 2-
          <issue>6</issue>
          ,
          <year>2020</year>
          , Proceedings,
          <source>Part I. Lecture Notes in Computer Science</source>
          , vol.
          <volume>12506</volume>
          , pp.
          <volume>565</volume>
          {
          <fpage>583</fpage>
          . Springer (
          <year>2020</year>
          ), https://doi. org/10.1007/978-3-
          <fpage>030</fpage>
          -62419-4_
          <fpage>32</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Walshe</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brennan</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>O</given-names>
            <surname>'Sullivan</surname>
          </string-name>
          ,
          <string-name>
            <surname>D.</surname>
          </string-name>
          :
          <article-title>Bayes-recce: A bayesian model for detecting restriction class correspondences in linked open data knowledge bases</article-title>
          .
          <source>International Journal on Semantic Web and Information Systems</source>
          <volume>12</volume>
          (
          <issue>2</issue>
          ),
          <volume>25</volume>
          {
          <fpage>52</fpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>