<!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>Adishesh Gonibeed Ravishankar1, Mehrnoosh Zaefi 1 and Srividya Bansal1</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="editor">
          <string-name>Editors: Ernesto Jiménez-Ruiz, Oktie Hassanzadeh, Cássia Trojahn, Sven Hertling, Huanyu Li, Pavel Shvaiko, Jérôme Euzenat</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Ontology alignment</institution>
          ,
          <addr-line>Ontology Matching, Deep Reinforcement Learning, Neural Network, Adaptive Learning</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>School of Computing and Augmented Intelligence, Arizona State University</institution>
          ,
          <addr-line>Tempe, AZ</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2025</year>
      </pub-date>
      <abstract>
        <p>a framework that uniquely applies a semi-supervised, deep reinforcement learning approach to eficiently align ontologies. By integrating both semantic and structural information, this work presents the results of our tool, DRAL-OA, on the challenging Anatomy dataset. The findings validate our framework, demonstrating that the reinforcement learning agent successfully optimizes concept embeddings. DRAL-OA is an ontology alignment system that uses a semisupervised machine learning technique that can predict similar source and target ontology classes based on their ontological structural hierarchy, meta-information, and syntactic structure without any background of domain knowledge, in contrast to existing learning-based approaches. In the following sections, we present the methodology behind the system and the results of the system's participation in the OAEI 2025 initiative. Ontology alignment, also called ontology matching, is the procedure of establishing semantic links between entities from diferent ontologies or knowledge graphs. This task is essential for resolving the semantic heterogeneity that arises when various communities independently create ontologies, leading to conceptual and structural diferences. The core function of alignment is to identify mappings between these distinct ontologies to enhance data interoperability and resolve ambiguity. By creating these semantic correspondences, the process facilitates efective knowledge sharing and enables seamless communication between systems built on diferent ontological foundations, making it a critical component of data integration.</p>
      </abstract>
      <kwd-group>
        <kwd>1</kwd>
        <kwd>1</kwd>
        <kwd>State</kwd>
        <kwd>purpose</kwd>
        <kwd>general statement</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        API named OWL API [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and HermiT Reasoner [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] are used to extract meta information about a
class/concept, such as IRI, label, restriction, parent, child, equivalent, and disjoint classes of each
      </p>
      <p>CEUR
Workshop</p>
      <p>ISSN1613-0073
class/concept of the source ontology (S) and the target ontology (T ).</p>
      <p>(ii) Data Pre-processing: Several data pre-processing techniques are used on both source and target
class/concept labels. Special characters and common stop-words in English are removed from the
class/concept labels. Apart from stopwords, we have used tokenization, lemmatization, conversion of
roman letters to numeric, etc.</p>
      <p>
        (iii) Vector Generation: In this step, a pre-trained embedding model called fastText [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] developed
by Facebook’s AI Research (FAIR) lab is used on the source and the target ontology class/concept to
generate vectors. It treats each word as composed of character n-grams. So, the vector for a word is
made up of the sum of these character n-grams. It helps create a meaningful vector even when the
dictionary word is not present in the model. The default dimension of the generated vector is 300.
      </p>
      <p>(iv) Model Prediction: The word similarity is calculated by the cosine similarity between the source
and target class/concept vectors. Next, the meta-information of the target ontology class is fed to
the trained ontology alignment model which predicts a vector similar to one of the source classes.
We use the cosine similarity to measure the meta similarity as well. A combined similarity i.e., the
average of the word similarity and meta similarity, is used for the final prediction of similar class/concept.</p>
      <p>
        (v) Vectorization of Classes Structural Relation After extracting the structural relations between
the classes of each ontology, a graph embedding based on the input ontologies was developed. The
graph captures various types of structural connections, including parent-child hierarchies, restrictions,
disjoint classes, and equivalences, efectively illustrating the intricate relationships among the nodes.
Next, we train the graph embedding and create a vector representation for the relation of each
class using the node2vec model [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Node2vec is an algorithmic framework designed for
representation learning on graphs, generating continuous feature representations for the nodes in any given graph.
      </p>
      <p>(vi) Creation of Training and Testing Datasets Finally, to create the training and testing datasets,
we used a semi-supervised approach, combining 50 percent data from an external resource with 50
percent data generated by our tuned graph embedding model.</p>
    </sec>
    <sec id="sec-2">
      <title>1.3. Deep Reinforcement Adaptive Learning</title>
      <p>
        Building on the innovative use of Deep Reinforcement Adaptive Learning (DRAL) in complex data
environments [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], we adapt and extend this method to the nuanced task of semantic ontology
alignment. This advanced adaptation involves the strategic alignment of classes between a source
ontology S and a target ontology T, using DRAL to intelligently navigate and optimize these mappings.
Our learning approach, showed in Algorithm 1, diverges from traditional adversarial learning methods,
leveraging a tailored DRAL algorithm that focuses on semantic precision and structural integrity rather
than mere classification accuracy.
      </p>
      <p>Environment: The DRAL environment is uniquely configured around the ontological structures,
incorporating the semantic and the vector representations of ontological concepts derived from
sophisticated embedding models. The agent acts on the current embedding  ′, resulting in a new state  ′+1 .
The efectiveness of each action is assessed by computing a reward based on how well the modified
embedding  ′+1 facilitates improved alignment between ontological classes, enhancing the precision of
ontology matching.</p>
      <p>State: In our DRAL framework, the state is defined by the vector representation  ′ of a class from
the source ontology. This representation encapsulates the current challenge faced by the RL agent,
ofering a detailed snapshot of the semantic attributes and potential alignment with the target ontology.</p>
      <p>Action: Actions are defined as selecting one of the values in the source ontology representation  ′
and modifying it by either adding or subtracting a small value  . The total number of actions is | ′| × 2.</p>
      <p>Reward Function: We have selected contrastive loss as the primary loss function for our project
due to its ability to finely diferentiate vector similarities, essential in ontology alignment. Formally, the
reward  +1 at a new state  +1 is calculated as follows:
 , = − log (</p>
      <p>exp(sim(  ,   )/ )
∑2= 1 [≠] exp(sim(  ,   )/ )
)
(1)
where sim(  ,   )represents the cosine similarity measure between the embeddings   and   , and 
denotes the temperature parameter that scales the similarity scores. The function aims to increase
the similarity of positive pairs while decreasing the similarity of negative pairs relative to an anchor,
enhancing discrimination in the embedding space.</p>
      <p>This method adapts the softmax function by adding a vector similarity measure through cosine
distance and a temperature normalization factor to tune sensitivity to vector variations. Similar to
CrossEntropyLoss but with a key distinction, contrastive loss computes the denominator values as the
cosine distances from a positive example to negative samples, enhancing the model’s discriminatory
power. The goal is for similar vectors to approach a similarity of 1, thereby minimizing the loss to
zero, while dissimilar pairs aim for a similarity near zero to maximize their contribution to the loss.
This approach ensures that our model sharply distinguishes between matching and non-matching
ontological terms, significantly improving alignment accuracy and efectiveness.</p>
      <p>1: Initialize state   and memory  .
2: while training is not finished do
  ←  ′
for  ∈ {0, 1, ...,  } do</p>
      <p>Perform   on   and get (</p>
      <p>+1 ,  +1 )
Choose action   according to current distribution  (  )</p>
      <p>,   ,  +1 ,  +1 )
 ←  + (

 ←  +1
end for</p>
      <p>← ∑=1   +1</p>
      <p>for each timestep  , reward  in   do
Calculate policy loss according to Equation 2</p>
      <p>Update the agent’s policy according to Equation 3
Algorithm 1 The Learning Process of DRAL-OA
Require: Ontologies representations  ′ ∈  , parameters  ,  , and  , learning rate  , and terminal time</p>
    </sec>
    <sec id="sec-3">
      <title>1.4. Optimization Algorithm</title>
      <p>the action   executed.</p>
      <p>The primary aim of this research is to develop and refine an optimal action-selection strategy  (  ,   )
tailored for the domain of ontology mapping. In this optimization, each timestep  necessitates the
DRAL agent to modify the representation   =  ′ of a class from the source ontology. The objective for
the agent is to maximize the reward  +1 , which is based on the updated representation  +1 =  ′+1 and</p>
      <p>For the training and optimization of our agent, the REINFORCE algorithm is employed, utilizing
a policy gradient approach to refine the mapping strategy. The agent’s policy, parameterized by  , is
denoted as   (  ,   )and is evaluated using the loss function:</p>
      <p>() = log(  (  ,   ) ⋅   )</p>
      <p>Here,   represents the cumulative sum of discounted rewards, calculated as ∑= 
serves as the discount factor. This emphasizes the valuation of more immediate rewards, which are
∞
−  +1 , where 
pivotal in our context of dynamic ontology mapping.</p>
      <p>The updating of policy parameters  is facilitated through gradient ascent, computed as follows:
∇ =  ∇()</p>
      <p>In this expression,  signifies the learning rate, a critical factor in managing the pace and efectiveness
of policy updates. This structured optimization framework enables the RL agent to incrementally
improve its decision-making processes, thereby enhancing its ability to propose mappings that are
both semantically coherent and structurally sound. Ultimately, this approach aims to not only optimize
immediate rewards but also to sustain the robustness and precision of mappings across heterogeneous
ontological structures.</p>
    </sec>
    <sec id="sec-4">
      <title>1.5. Adaptations made for the evaluation</title>
      <p>The DRAL-OA pipeline was implemented using Python and subsequently containerized with Docker
via the MELT platform to ensure ease of use and streamlined testing. We utilized the MELT Python
web matcher, which exposes an HTTP endpoint, enabling the matching system to receive source and
target RDF files and parameters through a URL-encoded form or multipart upload, directly returning
the final alignment. Although the system generally operated efectively, we encountered intermittent
(2)
(3)
output errors and compatibility issues when running the container on diferent operating systems. To
mitigate these inconsistencies and guarantee a clean output, an alternative deployment was provided
as a Google Colab notebook. This approach, while incurring a marginal increase in execution time,
ensured a stable and reproducible environment.</p>
    </sec>
    <sec id="sec-5">
      <title>1.6. Link to the system and parameters file</title>
      <p>The DRAL-OA code is available on GitHub: https://github.com/AGR19/DRAL-OA and on Google Colab
: https://colab.research.google.com/drive/1ApvzO1V0dZGjkARnRuYS_srvSP2-zwCt?usp=sharing</p>
    </sec>
    <sec id="sec-6">
      <title>1.7. Link to the set of provided alignments</title>
      <p>The DRAL-OA result is published on http://oaei.ontologymatching.org/2025/results/anatomy/index.html
. The result is also available on GitHub: https://github.com/AGR19/DRAL-OA</p>
      <sec id="sec-6-1">
        <title>2. Results</title>
        <p>
          We have tested DRAL-OA on the Anatomy [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] data set published by OAEI. Three inputs provided in
the OAEI System: source ontology, target ontology, and reference file containing correct matches to
calculate precision , recall and F-Measure . The DRAL-OA system yields satisfactory results with a
precision of 83%, recall of 82.7%, and F-measure of 82.8%. Table 1 gives a summary of the result of
DRAL-OA on the Anatomy data set.
        </p>
      </sec>
      <sec id="sec-6-2">
        <title>3. General comments</title>
        <p>In the ontology alignment task, the system generates multiple candidate matches for each class from
the source ontology, ranked by similarity scores. The evaluation considers the top-k highest-scoring
predictions. During our internal testing, we adopted a top-5 (k=5) evaluation, a more lenient approach
where a match is considered correct if the true correspondence appears anywhere within the five
highest-ranked predictions. This method is useful for maximizing recall, ensuring the correct answer is
included in the candidate set, though potentially with lower precision. In contrast, the oficial evaluators
calculated the final results using a top-1 (k=1) setting. This is the most restrictive metric, where only
the single best match is considered, and a prediction is deemed correct only if it is ranked first, thereby
prioritizing the highest precision at the expense of recall.</p>
      </sec>
      <sec id="sec-6-3">
        <title>4. Conclusion</title>
        <p>The paper presents DRAL-OA, a novel system for ontology alignment that uses a semi-supervised, deep
reinforcement learning (DRL) approach. The system efectively integrates both semantic information
(from class labels) and structural information (from relationships like parent-child, restrictions, etc.) to
map concepts between diferent ontologies.</p>
        <p>The core of the DRAL-OA framework is a reinforcement learning agent trained to intelligently
optimize the vector representations (embeddings) of concepts. By modifying these embeddings based
on a reward signal derived from a contrastive loss function, the agent improves the quality of the
alignments.</p>
        <p>When evaluated on the challenging Anatomy dataset from the Ontology Alignment Evaluation
Initiative (OAEI), the DRAL-OA system demonstrated strong performance, achieving a precision of 83
percent, a recall of 82.7 percent, and an F-measure of 82.8 percent. These results validate the efectiveness
of applying deep reinforcement learning to the complex task of ontology matching.</p>
      </sec>
      <sec id="sec-6-4">
        <title>Declaration on Generative AI</title>
        <p>During the preparation of this work, the authors used Gemini in order to check and improve grammar
and spelling of initial drafts. Afterwards, the authors reviewed and edited the content and take full
responsibility for the publication’s content.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>J.</given-names>
            <surname>Chakraborty</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bansal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Yaman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Virgili</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Konar</surname>
          </string-name>
          , Ontoconnect:
          <article-title>Unsupervised ontology alignment with recursive neural network</article-title>
          ,
          <source>in: Proceedings of the 36th ACM/SIGAPP Symposium on Applied Computing, SAC</source>
          <year>2021</year>
          , Gwangjiu, South Korea,
          <source>March</source>
          <volume>22</volume>
          -26,
          <year>2021</year>
          ,
          <year>2021</year>
          . (In Press).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M.</given-names>
            <surname>Horridge</surname>
          </string-name>
          ,
          <string-name>
            <surname>S. Bechhofer,</surname>
          </string-name>
          <article-title>The owl api: A java api for owl ontologies</article-title>
          ,
          <source>Semantic Web</source>
          <volume>2</volume>
          (
          <year>2011</year>
          )
          <fpage>11</fpage>
          -
          <lpage>21</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>B.</given-names>
            <surname>Motik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Shearer</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Horrocks</surname>
          </string-name>
          ,
          <article-title>Optimized reasoning in description logics using hypertableaux</article-title>
          ,
          <source>in: International Conference on Automated Deduction</source>
          , Springer,
          <year>2007</year>
          , pp.
          <fpage>67</fpage>
          -
          <lpage>83</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>P.</given-names>
            <surname>Bojanowski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Grave</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Joulin</surname>
          </string-name>
          , T. Mikolov,
          <article-title>Enriching word vectors with subword information, Transactions of the Association for Computational Linguistics 5 (</article-title>
          <year>2017</year>
          )
          <fpage>135</fpage>
          -
          <lpage>146</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>J.</given-names>
            <surname>Leskovec</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Grover</surname>
          </string-name>
          , node2vec:
          <article-title>Scalable feature learning for networks</article-title>
          , https://snap.stanford.edu/ node2vec/,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>A.</given-names>
            <surname>Mosallanezhad</surname>
          </string-name>
          , G. Beigi, H. Liu,
          <article-title>Deep reinforcement learning-based text anonymization against private-attribute inference</article-title>
          ,
          <source>in: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP)</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>2360</fpage>
          -
          <lpage>2369</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>A.</given-names>
            <surname>Mosallanezhad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Karami</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Shu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. V.</given-names>
            <surname>Mancenido</surname>
          </string-name>
          , H. Liu,
          <article-title>Domain adaptive fake news detection via reinforcement learning</article-title>
          ,
          <source>in: Proceedings of the ACM Web Conference</source>
          <year>2022</year>
          ,
          <year>2022</year>
          , pp.
          <fpage>3632</fpage>
          -
          <lpage>3640</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>OAEI</surname>
          </string-name>
          ,
          <article-title>Oaei 2025 anatomy track</article-title>
          , http://oaei.ontologymatching.org/2025/anatomy/index.html,
          <year>2025</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>