<!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>
      <journal-title-group>
        <journal-title>S. Menad);</journal-title>
      </journal-title-group>
      <issn pub-type="ppub">1613-0073</issn>
    </journal-meta>
    <article-meta>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Safaa Menad</string-name>
          <email>safaa.menad1@univ-rouen.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Saïd Abdeddaïm</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lina F. Soualmia</string-name>
          <email>fatima.soualmia@univ-rouen.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Workshop</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Univ Rouen Normandie</institution>
          ,
          <addr-line>Normandie Univ, LITIS UR 4108 F-76000 Rouen</addr-line>
          ,
          <country country="FR">France</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2024</year>
      </pub-date>
      <volume>000</volume>
      <fpage>0</fpage>
      <lpage>0002</lpage>
      <abstract>
        <p>This paper aims at presenting the results obtained by BioSTransMatch at the OAEI 2024 competition, marking its first participation in this event. In this context, we applied the model BioSTransformers we developed to the equivalence matching task in the Bio-ML track of the OAEI challenge. The model is founded on sentence transformers, that have recently achieved remarkable results in ontology matching tasks. Here, we leverage a transformer-based language model to identify similarities between ontology concepts. BioSTransformers is a siamese neural model that we developed and trained using biomedical scientific articles from PubMed. It embeds texts into a vector space to compare and identify similarities. The model optimizes a self-supervised contrastive learning objective using articles from the MEDLINE bibliographic database and their associated MeSH (Medical Subject Headings) keywords.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Related</title>
    </sec>
    <sec id="sec-2">
      <title>Work</title>
      <p>
        Ontology matching (OM) tasks have evolved significantly, incorporating a wide range of approaches,
from traditional methods [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ] to cutting-edge transformer-based techniques [
        <xref ref-type="bibr" rid="ref3 ref4">3, 4, 5</xref>
        ].
      </p>
      <p>
        Transformer-based approaches have successfully overcome a fundamental limitation of the existing
traditional methods: the inability to efectively take into account account contexts and synonyms when
comparing entities. These transformer-based methods can be categorized into two main types. The first
category includes unsupervised learning methods, such as [
        <xref ref-type="bibr" rid="ref3 ref4">4, 3</xref>
        ], which utilize embeddings to capture
semantic similarities. The second category involves supervised methods, which fine-tune models to
improve performance, as seen in works like [5, 6].
      </p>
      <p>More recently, large language model (LLM)-based methods have emerged as a promising direction.
For instance, OLaLa [7] utilized an SBERT model to extract top-k matches from target ontologies,
followed by an LLM to generate the alignments. LLMs4OM [8] is an end-to-end framework that
employs a RAG approach to retrieve additional context from a knowledge base. The LLM is then queried
using the retrieved information.</p>
    </sec>
    <sec id="sec-3">
      <title>2. Presentation of the System</title>
      <sec id="sec-3-1">
        <title>2.1. State, Purpose, General statement</title>
        <p>In recent years, ontology matching has garnered significant attention within various representation
learning systems. Particularly with advancements in machine learning, language model-based
approaches, such as [6], have been increasingly applied to this task. Although these systems have been
successfully used in ontology matching within general domains, the biomedical one requires special
consideration due to the caracteristics of the clinical and medical language.
(L. F. Soualmia)</p>
        <p>CEUR</p>
        <p>ceur-ws.org</p>
        <p>BioSTransformers is a transformer-based model built on a biomedical model [9]. It constructs
embeddings using the pretrained biomedical transformer, Bio_ClinicalBERT. This method has demonstrated
that training on biomedical data extracted from the PubMed database can lead to better vector
representations compared to other embedding models trained on general data. The purpose of our system is
to leverage these embeddings to create an ontology matcher that ofers a simple, fast, and generalizable
approach.</p>
        <p>Figure 1 presents the overall architecture of BioSTransMatch.</p>
      </sec>
      <sec id="sec-3-2">
        <title>2.2. Candidate Generation</title>
        <p>The first step of the matching process consists in determining the concepts to match. In the Bio-ML
track, some classes have the use_in_alignment property, which indicates whether they should be used
in the matching process. We have excluded all candidate concepts that have this property.</p>
        <p>For the local ranking sub-task, candidate mappings are suggested from a test.cands file. Therefore,
we utilize candidates from this list.</p>
        <p>We utilized DeepOnto [10], a Python library designed to facilitate ontology engineering with deep
learning techniques. DeepOnto encapsulates basic ontology processing functions from the OWL API
and implements several essential components such as reasoning, verbalization, pruning, and taxonomy,
etc.</p>
      </sec>
      <sec id="sec-3-3">
        <title>2.3. BioSTranformers Embeddings</title>
        <p>The goal of BioSTransformers is to obtain rich biomedical embeddings. Siamese transformers were
originally designed to transform similarly sized sentences into vectors.</p>
        <p>Sentence-BERT [11] is a BERT-based bi-encoder designed to generate semantically meaningful
sentence embeddings for use in textual similarity comparisons. For each input, the model produces
a fixed-size vector (  and  ). The objective function is designed such that the angle between the two
vectors  and  is smaller when the inputs are similar.</p>
        <p>In our approach, we propose transforming MeSH terms, titles, and abstracts of PubMed articles into
the same vector space by training a siamese transformer model on these data. To ensure compatibility
between short and long texts within this vector space, we trained our models using pairs of inputs such
as (title, MeSH term) and (abstract, MeSH term).</p>
        <p>We use a self-supervised contrastive learning objective function based on the Multiple Negative
Ranking Loss (MNRL) function. The MNRL only needs positive pairs as input (the title (or abstract) and
a MeSH term associated with the article in our case). For a positive pair (title  or abstract  , MeSH  ),
MNRL considers that each pair (title  or abstract  , MeSH  ) with  =  in the same batch is negative.
Since an article can be associated with several MeSH terms, we ensured in the batch generation that an
abstract (or title) associated with a MeSH term in PubMed is never taken as a negative pair.</p>
      </sec>
      <sec id="sec-3-4">
        <title>2.4. Compute Similarities</title>
        <p>Using our embeddings, we construct a similarity matrix founded on the cosine similarity measure as
shown in Equation 1.</p>
        <p>(,  ) = . (1)
||||| ||</p>
        <p>In the matrix, rows represent concepts from the source ontology, and columns represent concepts
from the target ontology. The matrix values are filled with the cosine similarities computed by
BioSTransformers.</p>
      </sec>
      <sec id="sec-3-5">
        <title>2.5. Threshold filter</title>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>3. Results</title>
      <sec id="sec-4-1">
        <title>3.1. Bio-ML Track</title>
        <p>In the next step, we filter out all scores below a threshold, efectively eliminating all correspondences
with low confidence. All correspondences with a score below are excluded. We set the threshold at
0.75, which yielded good results for the evaluated tasks.</p>
        <p>The Bio-ML track 1 consists of five diferent pairs of datasets and includes both an equivalence matching
task and a subsumption matching task. BioSTransformers participates in the equivalence matching
task only.</p>
        <p>The ontologies of this track are the OMIM (Online Mendelian Inheritance in Man), ORDO (Orphanet
Rare Disease Ontology), NCIT (National Cancer Institute Thesaurus), DOID (Human Disease Ontology),
FMA (Foundational Model of Anatomy), and SNOMED CT (Systematized Nomenclature of Medecine
Clinical Terms).</p>
        <p>• OMIM desribes genes, genetic phenotypes, and gene-phenotype relations, generated through
manual curation based on biomedical literature [12];
• ORDO is a classification of rare diseases and relationships between diseases, genes, and
epidemiologic features [13];
• NCIT is an ontology on cancer-related concepts [14];
• DOID describes human diseases [15];
• FMA represents a coherent body of explicit declarative knowledge about the human anatomy
[16].
• SNOMED CT is a structured clinical terminology that includes a vast collection of medical
concepts, relationships, and terms to accurately represent clinical findings, procedures, and
medications [17].</p>
        <p>The equivalence matching task is further divided into two categories: an unsupervised setting, and a
semi-supervised setting, where 30% of the reference alignments are provided in the training set.
1https://www.cs.ox.ac.uk/isg/projects/ConCur/oaei/</p>
      </sec>
      <sec id="sec-4-2">
        <title>3.2. Unsupervised Setting</title>
        <p>In this setting, we have used our model following the steps of the overall architecture in Figure 1. Table
1 shows the results on the diferent tasks.</p>
        <p>Global Matching To find the mappings between concepts for the global matching task, we select the
element in each row that represents the maximum similarity among the column elements. Specifically,
we choose the first element that has the highest similarity.</p>
        <p>Local Ranking In this step, we take all candidates and sort them in a decreasing order.</p>
      </sec>
      <sec id="sec-4-3">
        <title>3.3. Semi-supervised Setting</title>
        <p>The supervised model requires a dataset of both positive and negative alignments during training. This
dataset consists of reference alignments as well as generated positive and negative alignments.
Global Matching First, we trained our model on the training data from all tasks to fine-tune the
model across the entire dataset. The training was conducted using cosine similarity, with reference
alignments as positive samples and generating negative ones from the list of references.</p>
        <p>The second step involves training a neural classifier to select the best alignment from a list of
candidates. To achieve this, we used the fine-tuned model to generate similarity scores for each
candidate from the source data, and the trained classifier to choose the optimal alignment from the list
of candidates.</p>
        <p>Local Ranking As in the local ranking process for the unsupervised setting, all candidates are
considered and ranked. However, in this case, the ranking is based on the scores generated by the
ifne-tuned model. Table 2 presents the results for the diferent tasks.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>4. General Comments</title>
      <p>BioSTransMatch performs well in the local ranking task within the unsupervised setting, as
demonstrated in Table 1. The model achieves results comparable to state-of-the-art approaches in local ranking,
even under zero-shot conditions.</p>
      <p>However, for datasets such as SNOMED-FMA, SNOMED-NCIT (Neoplas) and OMIM-ORDO,
BioSTransMatch yielded lower-than-expected outcomes. This suggests that our current strategy—selecting
the alignment with the highest score—may not be optimal when identifying the correct match. To
address this, we extended the model to a semi-supervised setting, allowing it to learn to select the best
alignment from a list of candidates. This adjustment resulted in significantly improved performance
compared to the unsupervised approach.</p>
      <p>As potential avenues for optimizing the system, BioSTransMatch can be optimized in several ways.
One key enhancement involves incorporating additional information into the alignment process, as our
current method relies exclusively on label comparisons, which may not always provide suficient detail
for accurate matching.</p>
      <p>Furthermore, investigating alternative strategies for alignment selection in the global matching task
within the unsupervised setting could be advantageous. Rather than relying solely on the maximum
score, exploring methods such as greedy algorithms or the Max Weight Bipartite Extractor could yield
improved results. Additionally, experimenting with diferent threshold values for filtering could further
refine the system’s accuracy.</p>
    </sec>
    <sec id="sec-6">
      <title>5. Conclusion</title>
      <p>In this paper, we present the BioSTransMatch system and discuss its performance results in the BioML
track of the OAEI challenge. Our evaluation showed that the model achieved moderate performance in
the unsupervised mode. While BioSTransMatch delivered lower overall results in the global matching
task, it performed well in the local ranking task.</p>
      <p>In the semi-supervised setting, the system achieved significantly better results, highlighting the
potential of supervised learning in enhancing the alignment process. Additionally, our findings suggest
that leveraging textual information can be beneficial when generating correspondences between entities.</p>
      <p>For this first OAEI participation of BioSTransMatch, the reported results motivate further research in
the area of transformer-based ontology matching. The system can be greatly improved in the future,
by improving the candidate generation pipeline or using more information in the entity comparison.
There remains opportunities for enhancing its capabilities, we seek to a deeper analysis of ontology
structures to better leverage structural context.</p>
      <p>Future participations in OAEI also allows ongoing evaluation versus state-of-the-art matchers. Overall,
the results provide motivation to push the boundaries of adaptive ontology matching.
[5] F. Gosselin, A. Zouaq, Sorbet: A siamese network for ontology embeddings using a distance-based
regression loss and bert, in: International Semantic Web Conference, Springer, 2023, pp. 561–578.
[6] Y. He, J. Chen, D. Antonyrajah, I. Horrocks, Bertmap: a bert-based ontology alignment system, in:</p>
      <p>Proceedings of the AAAI Conference on Artificial Intelligence, volume 36, 2022, pp. 5684–5691.
[7] S. Hertling, H. Paulheim, Olala: Ontology matching with large language models, in: Proceedings
of the 12th Knowledge Capture Conference 2023, 2023, pp. 131–139.
[8] H. Babaei Giglou, J. D’Souza, S. Auer, Llms4om: Matching ontologies with large language models,
arXiv e-prints (2024) arXiv–2404.
[9] S. Menad, W. Laddada, S. Abdeddaïm, L. F. Soualmia, Biostransformers for biomedical ontologies
alignment, in: Proceedings of the 15th International Joint Conference on Knowledge Discovery,
Knowledge Engineering and Knowledge Management, IC3K 2023, Volume 2: KEOD, SCITEPRESS,
2023, pp. 73–84. doi:10.5220/0012188600003598.
[10] Y. He, J. Chen, H. Dong, I. Horrocks, C. Allocca, T. Kim, B. Sapkota, Deeponto: A python package
for ontology engineering with deep learning, arXiv preprint arXiv:2307.03067 (2023).
[11] N. Reimers, I. Gurevych, Sentence-BERT: Sentence embeddings using Siamese BERT-networks, in:
Proceedings of (EMNLP-IJCNLP), Association for Computational Linguistics, Hong Kong, China,
2019, pp. 3982–3992.
[12] A. Hamosh, A. F. Scott, J. S. Amberger, C. A. Bocchini, V. A. McKusick, Online mendelian
inheritance in man (omim), a knowledgebase of human genes and genetic disorders, Nucleic acids
research 33 (2005) D514–D517.
[13] D. Vasant, L. Chanas, J. Malone, M. Hanauer, A. Olry, S. Jupp, P. N. Robinson, H. Parkinson, A. Rath,
Ordo: an ontology connecting rare disease, epidemiology and genetic data, in: Proceedings of
ISMB, volume 30, researchgate. net, 2014.
[14] N. Sioutos, S. de Coronado, M. W. Haber, F. W. Hartel, W.-L. Shaiu, L. W. Wright, Nci thesaurus:
a semantic model integrating cancer-related clinical and molecular information, Journal of
biomedical informatics 40 (2007) 30–43.
[15] L. M. Schriml, E. Mitraka, J. Munro, B. Tauber, M. Schor, L. Nickle, V. Felix, L. Jeng, C. Bearer,
R. Lichenstein, et al., Human disease ontology 2018 update: classification, content and workflow
expansion, Nucleic acids research 47 (2019) D955–D962.
[16] C. Rosse, J. L. Mejino Jr, A reference ontology for biomedical informatics: the foundational model
of anatomy, Journal of biomedical informatics 36 (2003) 478–500.
[17] K. Donnelly, et al., Snomed-ct: The advanced terminology and coding system for ehealth, Studies
in health technology and informatics 121 (2006) 279.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>E.</given-names>
            <surname>Jiménez-Ruiz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. Cuenca</given-names>
            <surname>Grau</surname>
          </string-name>
          ,
          <article-title>Logmap: Logic-based and scalable ontology matching</article-title>
          ,
          <source>in: The Semantic Web-ISWC</source>
          <year>2011</year>
          : 10th International Semantic Web Conference, Bonn, Germany,
          <source>October 23-27</source>
          ,
          <year>2011</year>
          , Proceedings,
          <source>Part I 10</source>
          , Springer,
          <year>2011</year>
          , pp.
          <fpage>273</fpage>
          -
          <lpage>288</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>D.</given-names>
            <surname>Faria</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Pesquita</surname>
          </string-name>
          , E. Santos,
          <string-name>
            <given-names>M.</given-names>
            <surname>Palmonari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I. F.</given-names>
            <surname>Cruz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. M.</given-names>
            <surname>Couto</surname>
          </string-name>
          ,
          <article-title>The agreementmakerlight ontology matching system, in: On the Move to Meaningful Internet Systems: OTM 2013 Conferences: Confederated International Conferences: CoopIS</article-title>
          ,
          <string-name>
            <surname>DOA-Trusted</surname>
            <given-names>Cloud</given-names>
          </string-name>
          ,
          <source>and ODBASE</source>
          <year>2013</year>
          , Graz, Austria, September 9-
          <issue>13</issue>
          ,
          <year>2013</year>
          . Proceedings, Springer,
          <year>2013</year>
          , pp.
          <fpage>527</fpage>
          -
          <lpage>541</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          , Amd results for oaei
          <year>2022</year>
          ., in: OM@ ISWC,
          <year>2022</year>
          , pp.
          <fpage>145</fpage>
          -
          <lpage>152</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>D.</given-names>
            <surname>Faria</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. C.</given-names>
            <surname>Silva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Cotovio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Ferraz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Balbi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Pesquita</surname>
          </string-name>
          ,
          <article-title>Results for matcha and matcha-dl in oaei 2023</article-title>
          ., in: OM@ ISWC,
          <year>2023</year>
          , pp.
          <fpage>164</fpage>
          -
          <lpage>169</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>