<!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>ONTEM: Extraction based Alignment Method for Large Ontologies</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Zarhouni Mourad</string-name>
          <email>mourad.zerhouni@univ-sba.dz</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Benslimane Sidi Mohammed</string-name>
          <email>s.benslimane@esi-sba.dz</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>EEDIS Lab., University Djilali Liabes</institution>
          ,
          <addr-line>Sidi Bel Abbes</addr-line>
          ,
          <country country="DZ">Algeria</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Ecole Supérieure en Informatique, LabRiLaboratory</institution>
          ,
          <addr-line>Sidi Bel Abbès</addr-line>
          ,
          <country country="DZ">Algeria</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The rise of the semantic web and the development of different technologies allow different actors to access knowledge found in different ontologies. This is not always obvious because technical constraints such as data volume and execution time are determining factors in the choice of an alignment algorithm. Among the solutions for scaling, the extraction of ontological entities as well as for partitioning methods can be complementary to alignment techniques, given the reduction in the size of the ontologies to be aligned, and therefore the reduction in execution time. In this article, we propose a new alignment method based on the extraction of concepts and labels as well as the creation of correspondences in an automatic way. Indeed, we emphasize that this method does not require any calculation of similarity distance. The obtained results during the evaluation of our method show its effectiveness and can be a decisive turning point for the different existing alignment methods.</p>
      </abstract>
      <kwd-group>
        <kwd>Large Ontologies</kwd>
        <kwd>Alignment</kwd>
        <kwd>Extraction</kwd>
        <kwd>Partitionnement</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Nowadays, ontologies have become one of the most important research orientations,
especially with the advent of the Semantic Web. An ontology is defined as the
conceptualization of objects recognized as existing in a domain, their properties and the
relationships between them [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. They play a key role in annotating web pages or
services by modelling the concepts, attributes and relationships used to annotate resource
content. In many application contexts, several ontologies covering the same or related
fields are developed independently of each other by different communities, which
raises the issue of being able to exchange, integrate and transform data. At this stage,
the problem of interoperability arises, allowing heterogeneous systems to
communicate and cooperate, and to this end, semantic links must be established between
entities belonging to two different ontologies, and the transition to the web is a real
challenge that requires researchers to make efforts to optimize content management,
which can be constantly enriched and developed. To this end, it is necessary to
improve the quality of the organization, structuring, research, identification, access, use,
reuse of resources, integration, and automated processing of this content. All
alignment techniques are required to scale up to handle large ontologies [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ]. However,
this is not always obvious because the creation of multiple ontologies, sometimes for
the same domain, leads to a heterogeneity between the knowledge expressed within
each of them that must be resolved: it is the problem of interoperability.
The objective of our work is to meet the challenge of scaling up alignment method
[
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. In particular, we propose an algorithm to extract concepts and labels common to
both ontologies for alignment purposes [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Our algorithm has been tested on the
ontologies in the LargeBio_Track section of the OAEI_2018 campaign. Satisfactory
results have been achieved.
      </p>
      <p>This paper is organized as follows: Section 2 is a state of the art that presents the
different alignment strategies and focuses on related work. In section 3, we describe our
extraction based alignment method for large ontologies. Section 4 is an experimental
study that illustrates the results and performance of our method. Section 5 presents a
discussion of the results obtained. Finally, Section 6 concludes the document and
provides an overview of the directions for future work.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        Alignment consists in determining the set of correspondences between two ontologies
by using or implementing solutions to different heterogeneity problems. Several
alignment techniques, based on different criteria, are currently proposed in the
literature [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] provides a synthesis of alignment techniques.
      </p>
      <p>
        The choice of one technique or another or the composition of several of them is not an
easy task. Several studies complement their alignment results by using WordNet [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]
as an external resource, and many alignment methods dedicated to ontologies have
emerged in the last decade [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. However, these methods are designed to align small
ontologies. Partitioning [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] and modularization [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] are currently the two main
strategies for breaking down large ontologies into blocks or ontology modules,
respectively. These methods can only work if the number of concepts at the input of the
alignment tool is limited.
      </p>
      <p>
        One of the solutions for scaling involves the possibility of partitioning ontologies into
blocks before performing alignment [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. The partitioning strategy was proposed by
[
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] for partitioning into blocks of two large hierarchical classes.
      </p>
      <p>
        There are several approaches to partitioning. Graph-based approach applies
graphbased algorithms to decompose ontology [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. Logic-based approach uses description
logic to partition an ontology [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. Clustering-based approach consists in creating a
partition or a decomposition of this set into sub-parts (clusters) [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. The
modularization strategy was proposed by [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] to deal with large and complex dentistry. It breaks
down the problem of large-scale matching into sub-problems by matching at the level
of ontology modules [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ].
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>ONTEM APPROACH</title>
      <p>In this section, we propose an ONTology Extraction Method (ONTEM) based on an extraction
strategy that is, to our knowledge, almost non-existent in ontology alignment work. The
proposed method consists of four main steps: 1) Preprocessing, 2) Common entities identification,
3) Mapping generation, 4) Alignment generating. The general architecture of ONTEM is
illustrated in Figure 1.</p>
      <p>O1</p>
      <p>O2
g
n
i
s
s
e
c
o
r
p
e
r
P
s
e
i
t n
iten itcao
n i</p>
      <p>f
o it</p>
      <p>n
m e
om Id
C
s n
g io
ipn tra
p e
a n
M eG
t n
en io
t
a
m r
ign en
l e
A G</p>
      <sec id="sec-3-1">
        <title>Concepts</title>
        <p>Intersection</p>
      </sec>
      <sec id="sec-3-2">
        <title>Labels Intersection</title>
      </sec>
      <sec id="sec-3-3">
        <title>Concept Mappings Generation</title>
      </sec>
      <sec id="sec-3-4">
        <title>Label Mappings Generation</title>
      </sec>
      <sec id="sec-3-5">
        <title>Normalisation</title>
      </sec>
      <sec id="sec-3-6">
        <title>Tokenisation</title>
      </sec>
      <sec id="sec-3-7">
        <title>Concepts Difference</title>
      </sec>
      <sec id="sec-3-8">
        <title>Alignment</title>
      </sec>
      <sec id="sec-3-9">
        <title>Validation</title>
        <p>O1
Mappings
O2</p>
        <sec id="sec-3-9-1">
          <title>Preprocessing</title>
          <p>
            To facilitate the process of comparing the ontological terms labelling classes and their
properties (i.e. calculating the distances between their character strings), it is very
important to perform a number of pre-processing operations. They significantly
improve alignment results. In addition, when aligning based on synonym extraction,
preprocessing operations facilitate their recognition by lexical databases and/or synonym
dictionaries. The classes of an ontology are extracted after the conceptualization of
the targeted domain according to the objectives to be achieved and the application that
will use the ontology. We will call anchoring a concept of one ontology matched with
a single concept of another ontology, of the same name and meaning as it.We are
dealing with two types of anchor pairs: those obtained from the intersection of
concepts and those obtained from common labels. The approach exploits the richness of
the concept labels. Labels are made up of several words [
            <xref ref-type="bibr" rid="ref18">18</xref>
            ]. It assumes that similar
concepts share part of their label. It is therefore more appropriate for aligning
taxonomies whose concept names are expressions composed of several words because, in
this case, these names may share words, which may reveal common points between
the concepts concerned.
          </p>
          <p>Two linguistic techniques used are. Normalisation which consists of : 1) transforming
all the characters of the ontological terms into lower-case letters, 2) stripping of
special characters, spaces, and numbers, 3) elimination of coordinating conjunctions,
articles, prepositions, 4) elimination of words designating sets or elements
(composition words). Tokenisation, which is a lexical analysis that consists in transforming a
character stream into a token stream by an analyzer (Tokenizer) that recognizes
punctuation, white characters, etc.</p>
          <p>The pre-processing phase is illustrated by Algorithm1</p>
        </sec>
        <sec id="sec-3-9-2">
          <title>Algorithm1: Preprocessing</title>
          <p>Inputs:Ontology O
Outputs:List_of_Concepts, List_of_Labels, Index_of_Concepts, Index_of_Labels
Begin
For Each Concept of O do</p>
          <p>CN=Normalize(Concept)
CT=Tokenize (CN)
Add(Concept,CT)
Add((Concept,CT),INDEX_CONCEPTS)
For Each Label ofConcept</p>
          <p>LN=Normalize (Label)
LT=Tokenize (LN)
Add(Label,LT)</p>
          <p>Add((Label,LT),INDEX_LABELS)</p>
          <p>EndFor
EndFor
Return (List_of_Concepts, List_of_Labels, Index_of_Concepts, Index_of_Labels)
End</p>
        </sec>
        <sec id="sec-3-9-3">
          <title>Common entities identification</title>
          <p>Since the ontologies treated concern the same field, it is obvious that they share
common elements. This observation leads us directly to consider the common
elements to both ontologies. The elements common to both ontologies can obviously be
concepts, labels, properties, as well as relationships. Given two voluminous
ontologies, the objective is to match the concepts of the first ontology with the concepts of
the second ontology. To do this, we will use the "Intersection" operation to determine
the common concepts to both ontologies.
3.2.1 Intersection of common entities
Given a domain D and two ontologies O1ϵ D and O2ϵ D.</p>
          <p>Let LCO1 and LCO2 the list of concepts of Ontology 1 and Ontology 2 respectively.
Let LLO1 and LLO2 the list of labels of Ontology 1 and Ontology 2 respectively.
The set LIC (List of Intersection of Concepts) will form the list of common concepts
to both ontologies.</p>
          <p>LIC=LCO1∩ LCO2.</p>
          <p>In the same way, the set LIL (List of Intersection of Labels) will form the list of
common labels to both ontologies.</p>
          <p>LIL=LLO1∩ LLO2.</p>
          <p>The intersection of common entities (concepts and labels) is performed by
Algorithm2 for concepts and Algorithm3 for labels.</p>
        </sec>
        <sec id="sec-3-9-4">
          <title>Algorithm2: Intersection of Concepts</title>
          <p>Inputs: LCO1, LCO2
Outputs: LIC
Begin
LIC = Intersection (LCO1,LCO2)
Return (LIC)
End</p>
        </sec>
        <sec id="sec-3-9-5">
          <title>Algorithm3: Intersection of Labels</title>
          <p>Inputs: LLO1, LLO2
Outputs: LIL
Begin
LIL = Intersection (LLO1,LLO2)
Return (LIL)</p>
          <p>End
3.2.2 Difference of concepts
In this phase, we retain only the non-composed concepts. We will only select
concepts that are not composed and do not belong to LIC. A compound concept being a
name that contains at least one character" _".
Let LNCCO1 the list of non-composed concepts of Ontology 1.</p>
          <p>Let LCSSO1, list of Concepts for Searching Synonyms of Ontology 1.
The difference on concepts is performed by Algorithm 4.</p>
        </sec>
        <sec id="sec-3-9-6">
          <title>Algorithm4: Difference of concepts</title>
          <p>Inputs: LNCCO1, LIC
Outputs: LCSSO1
Begin
LCSSO1 = Difference (LNCCO1,LCI)
Return (LCSSO1)</p>
          <p>End
3.3</p>
        </sec>
        <sec id="sec-3-9-7">
          <title>Mapping generation</title>
          <p>The mapping discovery process, called ontology alignment, is a function f that
applies to two ontologies O1 and O2, with a set of parameters p (weights, thresholds,
etc.) and a set of external resources r, and produces a set of mapping A.</p>
          <p>A=f(O1,O2,p,r).</p>
          <p>
            Alignment consists of several steps [
            <xref ref-type="bibr" rid="ref19">19</xref>
            ]: extracting the data to be reconciled,
selecting the pairs of elements to be compared, calculating a similarity for each selected
pair, deducing the alignment from the previously calculated similarity measurements.
Each method of calculating a similarity measure corresponds to the execution of a
particular alignment technique. Several classifications of these techniques have been
proposed in the literature [
            <xref ref-type="bibr" rid="ref20 ref21 ref22">20, 21, 22</xref>
            ].We find that each of the concepts in the first
ontology directly points to their corresponding concepts in the second ontology. The
anchor pair is saved in the LCC list. The algorithm for generating direct concept
mappings is represented by the Algorithm 5.
          </p>
        </sec>
        <sec id="sec-3-9-8">
          <title>Algorithm5: Generating direct concept mappings</title>
          <p>Inputs: LIC, ICO1, ICO2
Outputs: LCC
Index_Mappings
Begin
For Each Conceptϵ LIC do</p>
          <p>Entity_Name_1=Read(Concept, ICO1)
Entity_Name_2=Read(Concept,ICO2)
Add (Entity_Name_1,LCC)
Add(Entity_Name_2,LCC)</p>
          <p>Add (Entity_Name_1,Entity_Name_2, Index_Mappings)
EndFor
Return(LCC)
End
The algorithm for generating concept matches from the list of common labels is
represented by the Algorithm 6.</p>
        </sec>
        <sec id="sec-3-9-9">
          <title>Algorithm6: Generating mapping concepts based on common labels</title>
          <p>Inputs :LIL, ILO1, ILO2, ICO2, Index_Mappings
Outputs :LLC, Index_Mappings /* Updated */
Begin
For Each (Label ϵ LIL) do
/* browse the labels of LIL */</p>
          <p>Entity_Name_1=Read(Label, ILO1)</p>
          <p>Entity_Name_2=Read(Label, ILO2)
Found=0</p>
          <p>While (Entity_Name_2 hasValues Is True) &amp;&amp; (Found==0)
/* Retrieving Entity_name2 not yet used */</p>
          <p>IF (Entity_Name_1,Entity_Name_2) not found in Index_Mappings
Add(Entity_Name_1,LLC)
Add(Entity_Name_2,LLC)
/* insert Entity_Name_1 and Entity_Name2 in LLC */
Add(Entity_Name_1,Entity_Name_2, Index_Mappings)
/*Update of the Index_Mappings */</p>
          <p>Found=1;
Else</p>
          <p>Entity_Name_2=Read(Label, ILO2)</p>
          <p>EndIf</p>
          <p>EndWhile
EndFor
Return(LCL, Index_Mappings)</p>
          <p>End
3.4</p>
        </sec>
        <sec id="sec-3-9-10">
          <title>Alignment generation</title>
          <p>The alignment will be created automatically from the LCC, LCL and LCW lists. The
algorithm for generating the alignment is illustrated by the Algorithm 7.</p>
        </sec>
        <sec id="sec-3-9-11">
          <title>Algorithm7: Alignment Generation</title>
          <p>Inputs: LCC, LCL, LCW
Outputs: F-ALIGNE
For Each Concept ϵ LCC do</p>
          <p>Entity_Name_1=Read(Concept, LCC)
Entity_Name_2=Read(Concept, LCC)
Add(Entity_Name_1,F-ALIGNE)</p>
          <p>Add(Entity_Name_2,F-ALIGNE)
EndFor
For Each Concept ϵ LCL do</p>
          <p>Entity_Name_1=Read(Concept, LCL)</p>
          <p>Entity_Name_2=Read(Concept, LCL)
Add(Entity_Name_1,F-ALIGNE)</p>
          <p>Add(Entity_Name_2,F-ALIGNE)
EndFor
For Each Concept ϵLCW do</p>
          <p>Entity_Name_1=Read(Concept, LCW)
Entity_Name_2=Read(Concept, LCW)
Add(Entity_Name_1,F-ALIGNE)</p>
          <p>Add(Entity_Name_2,F-ALIGNE)
EndFor
Return (F-ALIGNE)
End</p>
          <p>ONTEM is a fully automatic method and requires no user intervention during the
alignment process. However, the expert who is a knower of the field can confirm,
suggest other alignments
4</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Experimentation</title>
      <p>
        To highlight the validity of our method, we will compare the alignments that
ONTEM has produced with a reference alignment contained in the
Oaei_LargeBio_Track_2018 section [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ].
      </p>
      <p>
        The ONTEM prototype was developed on the Eclipse Helios platform, using the
java and APIjena2.4 programming language, as well as the SPARQL semantic graph
reading language.The machine on which the work was performed has an Intel® Core
TM(2) Duo CPU E7500 2.93 Ghz 2.94 Ghz, 4.0 GB RAM, 32bit operating system,
Windows 7 Professional N.The evaluation metrics Precision, Recall and F-measure
were used to compare our ONTEM method with other pioneering methods in the
field, namely: AML, FCAMapX, LogMapBio, LogMap, LogMapLt, XMap,
POMAP++[
        <xref ref-type="bibr" rid="ref24">24</xref>
        ], DOME, ALDO2Vec, KEPLER[
        <xref ref-type="bibr" rid="ref25">25</xref>
        ]. The results are illustrated in
Figures 2 and 3.
Although ONTEM does not perform any similarity calculations, the results we
have achieved are more than satisfactory. They have shown promising results for its
first comparison with the reference alignments contained in the LargeBioTrack 2018
section. We show through ONTEM that even if the ontologies are very large, their
effectiveness increases. Therefore, it is not necessary to limit the size of the concept
sets at the input of the alignment tool. We are convinced that ONTEM will provide a
new basis for all other methods based on similarity calculations. Indeed, these
calculations will only concern concepts not processed by our method.
5
      </p>
    </sec>
    <sec id="sec-5">
      <title>Conclusion and perspectives</title>
      <p>In this article, we have focused on the issue of large-scale ontology alignment for
the Semantic Web. Indeed, the variety of ontologies of the same domain in the
semantic web has led to heterogeneity and therefore to the development of ontology
alignment methods. For more than a decade, ontology alignment methods have been
attempting to solve heterogeneity and ontology matching problems. Today in many real
applications such as in the medical field, the size of ontologies is very large and
current alignment methods are faced with many challenges such as lack of memory and
long processing times. We have shown that our ONTEM method stands out from the
crowd of existing methods by its originality. It makes it possible to build new
architectures based on existing methods that will boost ONTEM for much better results,
because the purpose of all the work is to be able to make ontology-based information
systems interoperable. To this end, this document provides an appropriate solution to
this type of problem.A prototype has been set up to support the proposed approach.
With this realization, we were able to evaluate our comments and compare them with
other recognized methods in this field such as the OAEI_LargeBio_Track section of
the 2018 campaign.</p>
      <p>In our future work, we plan to consolidate our method to better support the
alignment of full-scale large ontologies. We have already started to address this issue, but
updating the test database poses other challenges, in terms of the ontological
languages used and the evolving semantic description formalisms.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Furst</surname>
            <given-names>F.</given-names>
          </string-name>
          ,
          <article-title>Contribution à l'ingénierie des ontologies : une méthode et un outil d'opérationnalisation</article-title>
          , thèse de doctorat, Université de Nantes ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Diallo</surname>
            <given-names>G.</given-names>
          </string-name>
          <article-title>An effective method of large scale ontology matching</article-title>
          .
          <source>J Biomed Semant</source>
          .
          <year>2014</year>
          ;
          <volume>5</volume>
          (
          <issue>1</issue>
          ):
          <fpage>44</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Jimenez-Ruiz</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cuenca Grau</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Horrocks</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Large-scale interactive ontology ´ matching: Algorithms and implementation</article-title>
          .
          <source>In: European Conf. Artif. Intell. (ECAI)</source>
          .
          <article-title>(</article-title>
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Ivanova</surname>
            ,
            <given-names>V</given-names>
          </string-name>
          , Lambrix,
          <string-name>
            <given-names>P</given-names>
            , and
            <surname>Aberg</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.</surname>
          </string-name>
          ,
          <article-title>Requirements for and evaluation of user support for large-scale ontology alignment</article-title>
          .
          <source>In Proceedings of the European Semantic Web Conference</source>
          , pages
          <fpage>3</fpage>
          -
          <lpage>20</lpage>
          ,
          <year>2015</year>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>319</fpage>
          -18818-8
          <fpage>1</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <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>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Euzenat</surname>
            <given-names>J</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shvaiko</surname>
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Ontology</surname>
            <given-names>Matching</given-names>
          </string-name>
          ,
          <source>2nd edition</source>
          , Springer;
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Miller</surname>
            <given-names>G.</given-names>
          </string-name>
          , al.,
          <article-title>Introduction to WordNet: An on-line lexical database</article-title>
          , MIT Press,
          <year>1993</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Fatima</surname>
            <given-names>Ardjani</given-names>
          </string-name>
          , DjelloulBouchiha, MimounMalki, Ontology-Alignment Techniques:
          <article-title>Survey and Analysis</article-title>
          ,
          <source>IJMECS</source>
          , vol.
          <volume>7</volume>
          , no.
          <issue>11</issue>
          , pp.
          <fpage>67</fpage>
          -
          <lpage>78</lpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Pereira</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cross</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jimenez-Ruiz</surname>
          </string-name>
          , E.:
          <article-title>On partitioning for ontology alignment</article-title>
          .
          <source>In: International Semantic Web Conference (Posters &amp; Demonstrations)</source>
          . (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Emanuel</surname>
            <given-names>Santos</given-names>
          </string-name>
          , Daniel, CatiaPesquita, and Francisco M Couto.
          <article-title>Ontology alignment repair through modularization and confidence-based heuristics</article-title>
          .
          <source>PLoS ONE</source>
          ,
          <volume>10</volume>
          (
          <issue>12</issue>
          ):
          <fpage>e0144807</fpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Hu</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Qu</surname>
          </string-name>
          , Y., Cheng, G.:
          <article-title>Matching Large Ontologies: A Divide-and-Conquer Approach</article-title>
          .
          <source>Journal on Data and Knowledge Engineering</source>
          , vol.
          <volume>67</volume>
          (
          <issue>1</issue>
          ), p.
          <fpage>140</fpage>
          --
          <lpage>160</lpage>
          .
          <year>2008</year>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Hu</surname>
            <given-names>Wei</given-names>
          </string-name>
          ,
          <article-title>Zhao Yuanyuan and QuYuzhong. Partition-Based Block Matching of Large Class Hierarchies</article-title>
          .
          <source>In: Proceedings of the First Asian Semantic Web Conference</source>
          ,
          <volume>3</volume>
          -
          <fpage>7</fpage>
          ,
          <year>2006</year>
          , Beijing, China.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Silva</surname>
            ,
            <given-names>F.B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tabbone</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Torres</surname>
          </string-name>
          , R.d.S.:
          <article-title>Bog: A new approach for graph matching</article-title>
          .
          <source>In: Pattern Recognition (ICPR)</source>
          ,
          <year>2014</year>
          22nd International Conference on. pp.
          <fpage>82</fpage>
          -
          <lpage>87</lpage>
          . IEEE (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Jiménez-Ruiz</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Grau</surname>
            ,
            <given-names>B.C.</given-names>
          </string-name>
          (
          <year>2011</year>
          ).
          <article-title>Logmap: Logic-based and scalable ontology matching</article-title>
          .
          <source>The Semantic Web-ISWC 2011</source>
          . Springer
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15. Soraya Setti Ahmed, MimounMalki, Sidi Mohamed Benslimane.
          <article-title>Ontology Partitioning: Clustering Based Approach</article-title>
          .
          <source>International Journal of Information Technology and Computer Science</source>
          ,
          <year>2015</year>
          ,
          <volume>06</volume>
          ,
          <fpage>1</fpage>
          -
          <lpage>11</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Ernesto</surname>
          </string-name>
          Jimenez-Ruiz, Bernardo Cuenca Grau,
          <string-name>
            <surname>Yujiao Zhou</surname>
            , and
            <given-names>Ian</given-names>
          </string-name>
          <string-name>
            <surname>Horrocks</surname>
          </string-name>
          .
          <year>2012</year>
          .
          <article-title>Large-scale interactive ontology matching: Algorithms and implementation</article-title>
          .
          <source>Frontiers in Artificial Intelligence and Applications</source>
          ,
          <volume>444</volume>
          -
          <fpage>449</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <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>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Ruder</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , Vuli_c, I., S_gaard, A.:
          <article-title>A survey of cross-lingual word embedding models</article-title>
          .
          <source>arXiv preprint arXiv:1706.04902</source>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>M. Ehrig</surname>
          </string-name>
          , Ontology Alignment:
          <article-title>Bridging the Semantic Gap</article-title>
          ,
          <source>Semantic Web and Beyond Computing for Human Experience 4</source>
          , Springer, (
          <year>2007</year>
          ), pp.
          <fpage>1</fpage>
          -
          <lpage>250</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Zhao</surname>
            <given-names>M</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
            <given-names>S. Identifying</given-names>
          </string-name>
          <article-title>and validating ontology mappings by formal concept analysis</article-title>
          .
          <source>In: ISWC Conference on Ontology Matching (OM)</source>
          , vol.
          <volume>1766</volume>
          :
          <year>2016</year>
          . p.
          <fpage>61</fpage>
          -
          <lpage>72</lpage>
          . Online: www.
          <source>CEUR-WS.org.</source>
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Diallo</surname>
            <given-names>G.</given-names>
          </string-name>
          <article-title>An effective method of large scale ontology matching</article-title>
          .
          <source>J Biomed Semant</source>
          .
          <year>2014</year>
          ;
          <volume>5</volume>
          (
          <issue>1</issue>
          ):
          <fpage>44</fpage>
          .
          <string-name>
            <surname>-</surname>
          </string-name>
          47
          <string-name>
            <surname>-Horridge</surname>
            <given-names>M</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bechhofer</surname>
            <given-names>S.</given-names>
          </string-name>
          <article-title>The OWL API: A java API for OWL ontologies</article-title>
          .
          <source>Semantic Web</source>
          .
          <year>2011</year>
          ;
          <volume>2</volume>
          (
          <issue>1</issue>
          ):
          <fpage>11</fpage>
          -
          <lpage>21</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Stoilos</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Geleta</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shamdasani</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Khodadadi</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>A novel approach and practical algorithms for ontology integration</article-title>
          .
          <source>In: Proceedings of ISWC</source>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>23. http://www.cs.ox.ac.uk/isg/projects/SEALS/oaei/2018/result</mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Laadhar</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Ghozzi</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          <string-name>
            <surname>Megdiche</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Ravat</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          <string-name>
            <surname>Teste</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <article-title>GargouriPOMap: An Effective Pairwise Ontology Matching System 9th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management (KEOD'17), Funchal (Madeira, Portugal) 2017</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Kachroudi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Diallo</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yahia</surname>
            ,
            <given-names>S.B.</given-names>
          </string-name>
          :
          <article-title>OAEI 2017 results of KEPLER</article-title>
          . In: 12th International Workshop on Ontology Matching. (
          <year>2017</year>
          )
          <fpage>138</fpage>
          -
          <lpage>145</lpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>