<!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>ONTMAT: Results for OAEI 2017</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Saida Gherbi</string-name>
          <email>Saida_gharbi23@yahoo.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tarek Khadir</string-name>
          <email>Khadir@labged.net</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>LabGed</institution>
          ,
          <addr-line>ESTI, Annaba 23000</addr-line>
          ,
          <country country="DZ">Algeria</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>LabGed, University Badji Mokhtar Annaba</institution>
          ,
          <addr-line>23000</addr-line>
          ,
          <country country="DZ">Algeria</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper describes ONTMAT an ontology matching system, and presents the results obtained for the Ontology Alignment Evaluation Initiative (OAEI) 2017. ONTMAT is an ontology matching process, which compares the instances of ontologies to align in order to deduce the relations between their concepts. Then, based on hierarchical and binary relations between the concepts inside the ontologies it performs entities matching.</p>
      </abstract>
      <kwd-group>
        <kwd>Ontology</kwd>
        <kwd>Alignment</kwd>
        <kwd>OWL</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>1.1</p>
    </sec>
    <sec id="sec-2">
      <title>State, purpose, general statement</title>
      <p>
        ONTMAT uses a terminological methods based on WordNet dictionary [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ],which is
exploited as background knowledge to provide a set of the relations between
individuals names of the ontologies source ( ) and target( ). Then, if the name does not
exist in WordNet the approach handles the n-gram measure instead of the dictionary.
Moreover, from this set of individual relations we will deduce the equivalence or
subsumption relation among their concepts. The equivalent concepts are recorded in
an alignment matrix (AM), and the concepts related by subsumptions relations are
registered within a temporary alignment matrix (TAM) [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
      </p>
      <p>
        Furthermore, the TAM elements and the concepts neighbors of AM are compared
by using the inference roles with the terminological techniques cited previously and
the retained alignment will be added to AM. The concepts neighbors are those related
by hierarchical or binary relations with AM concepts. Here, we first align the
neighboring concepts because they have more chance to be similar [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], after we will align
the other concepts by using the same technics. Next, inference technics are applied on
AM to align the binary relations.
      </p>
    </sec>
    <sec id="sec-3">
      <title>Approach description</title>
      <p>
        In our proposition we suppose that Wordnet is hierarchically organized as
W(S,≤,Ag,g), where S is a set of synsets {s1,s2,…,si}(i is a positive integer), and an
annotate function Ag associates the gloss g to each synset. Furthermore, the relations
≤ between concepts , may be presented in the following logical relations [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] as:
1) ;means that is a hyponym or meronym of ;
2) ; express that is a hypernym or holonym of ;
3) ; signified that and belong to the same synset are similar[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ];
4) when and are the siblings in the part of hierarchy they are
connected by a relation of antonymy.
      </p>
      <p>
        The entities aligned can be related by one of the hierarchical relation presented in
the set , , where ( : equivalence; subclass), fuzzy relation
symbolized by “&amp;”, or binary relation. Further, the binary ontologies relations (O1, O2)are
also aligned by an element of the set HR. The algorithm will explain in the following
items:
1. In level 1 we compare the instances names (IO1,IO2) of ontologies( , )to deduce
the relations among their concepts. To do this, WordNet is exploited because we
cannot assume with certainty that two entities are dissimilar if they have different
names (synonyms), or they are equivalent if they have the same name(homonyms).
If the name does not existed in WordNet we will measure the similarity among
names by the n-gram measure. Then the equivalent instances will construct the
instances matrix IM. The concepts (C1,C2) of ( , ) that have the same sets of
instances in IM are considered as equivalent concepts as proven in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], and
( , , ) can be added to AM. Although, if the instances set of C1 are included in
the instances set of C2then ( , , ) will be inserted in TAM.
2. The level 2 starts by applying terminological techniques on the concepts names.
      </p>
      <p>
        Next the results obtained will be combined with inferences methods illustrated in
[
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] to be inserted in AM: ( , , ) of TAM confirmed or modified, where
, , , .
3. The concepts neighbors sorted by hierarchical relations of the AM elements
( , , ), are ( , linked to ( , respectively by an element of the set
HR. The neighbors , joined by " " with , of AM in ( , ), will be
aligned by using the inferences techniques applied on the background knowledge
[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. The background knowledge is the ontology source when the neighbors belong
to O1, and ontology target if we match the neighbors existing in O2. The other
neighbors will be matched using the terminological methods.
4. The fourth level exploits the description logic roles proven in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] to match the
concepts ( , associated to ( , by binary relations ( , ) in ( , ), as
following:
─ If ( , , ( , , then ( , ,
      </p>
      <p>ment Binary Relation Source Matrix)
─ If ( , , ( , , then ( , ,</p>
      <p>
        Binary Relation Target Matrix)
will be inserted to ABRSM
(Alignwill be added to ABRTM (Alignment
Thus, binary relations can be aligned because we have: hR Iff dom( ) hR
dom( ) and ran( ) hR ran( ); where [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], for instance;
If ( , , , , , , ( , , then ( , , ) will
be added to ABR (Alignment Binary Relation Matrix).
5. Finally, the concepts not yet aligned, will be matched via the terminological
methods.
1.3
      </p>
    </sec>
    <sec id="sec-4">
      <title>Adaptations made for the evaluation</title>
      <p>We have adapted the format of the alignment result to the reference alignments
restricted to name classes, using the “=” sign for equivalence relation with confidence
of 1. Although our system provides other relations as subsumption, and binary
relations without measure, as well as the alignment of binary relation by the HR.
2</p>
      <sec id="sec-4-1">
        <title>Results</title>
        <p>In this version we wish to test the techniques used by ONTMAT, such as, the
inferences mechanisms applied onWordNet and the ontologies source and target, and the
deduction of the matching among entities based on instances. The most appropriate
track to do these tests is the conference track.</p>
        <p>Conference track comprises 16 ontologies from the domain of conference
organization. Most ontologies of this track were equipped with OWL DL axioms; which is
useful to test our inferences approach. Table 1shows the evaluation result obtained by
running ONTMAT under the SEALS client with the command:
java -jar F:/temp/seals-omt-client.jar F:/temp/ONTMAT -t</p>
        <p>This command tests two predefined ontologies from the Conference. From Table 1
we can write that ONTMAT perform well because these ontologies are the same
structure.</p>
        <p>The results obtained by the global test as illustrated in Table 2, are not well as the
results of the precedent table in term of precision and F-measure. Although, the global
recall is 0.434.
cmt-ekaw
cmt-iasted
cmt-sigkdd
conference-confof
conference-edas
conference-ekaw
conference-iasted
conference-sigkdd
confof-edas
confof-ekaw
confof-iasted
confof-sigkdd
edas-ekaw
edas-sigkdd
ekaw-iasted
ekaw-sigkdd
iasted-sigkdd
Global</p>
        <p>The application seals-omt-client from seal, only test files where the alignment
relation between concepts is itself the equivalence relation. However ONTOMAT, offers
other possibilities in terms alignment relations between entities such as; &amp; : Fuzzy
and binary relations. We hope that OAEI takes into consideration those types of
relations in the reference alignment file.
3</p>
      </sec>
      <sec id="sec-4-2">
        <title>Conclusion and future work</title>
        <p>We have briefly described the mechanisms exploited by our proposition ONTMAT,
and presented the results obtained under the conference track of OAEI 2017.
This is our first participation in OAEI, the results are not satisfying, and the system
presents some limitations. In the future, we will make great efforts to improve
ONTMAT results, and participate in more tracks.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Euzenat</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shvaiko</surname>
          </string-name>
          . P. “Ontology Matching” , pages
          <fpage>37</fpage>
          -
          <lpage>39</lpage>
          ;
          <fpage>73</fpage>
          -
          <lpage>87</lpage>
          ,
          <fpage>92</fpage>
          -
          <lpage>93</lpage>
          . SpringerVerlag Berlin Heidelberg,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Fellbaum</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>WordNet: An Electronic Lexical Database</article-title>
          , MIT Press, Cambridge, MA (
          <year>1998</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3. GherbiS.,
          <source>BelleiliH</source>
          .andKhadirM.,
          <year>2013</year>
          . BRMAP :
          <article-title>Un outil d'Alignement des ontologies. 7ème édition de la conférence maghrébine sur les avancés des systèmes décisionnels</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4. GherbiS., 535 M. T. Khadir,
          <article-title>Inferred ontology concepts alignment using and an external dictionary</article-title>
          ,
          <source>Procedia Computer Science</source>
          <volume>83</volume>
          (
          <year>2016</year>
          )
          <fpage>648</fpage>
          -
          <lpage>652</lpage>
          , the 7th
          <source>International Conference on Ambient Systems, Networks and Technologies (ANT 2016) / The 6th International Conference on Sustainable Energy Information Technology (SEIT-</source>
          <year>2016</year>
          ) / Aliated Workshops.doi:http://dx.doi.org/10.1016/j.procs.
          <year>2016</year>
          .
          <volume>04</volume>
          .145.URL http://www.sciencedirect.com/science/article/pii/ S1877050916301752.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Giunchiglia</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shvaiko</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yatskevich</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <year>2004</year>
          .
          <article-title>SMatch an algorithm and an implementation of semantic matching</article-title>
          .
          <source>In Proc. 1st EuropeanSemanticWeb Symposium (ESWS)</source>
          , volume
          <volume>3053</volume>
          of Lecture notes in computer science, pages
          <fpage>61</fpage>
          -
          <lpage>75</lpage>
          , Hersounisous (GR),
          <fpage>10</fpage>
          -
          <lpage>12</lpage>
          May
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>