<!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>Enhancing Entity Matching Through Systematic Association of Matchers to Linking Problem Types</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Chloé Khadija Jradeh</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Konstantin Todorov</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Cassia Trojahn</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>IRIT</institution>
          ,
          <addr-line>Maison de la Recherche, 5 Allées Antonio Machado, 31058 Toulouse</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>MarvelCinematicUniverse-Marvel</institution>
          ,
          <addr-line>Memory alpha-Memory beta, Memory alpha-stex, Starwars-swg, Starwarsswtor MarvelCinematicUniverse-Marvel, Starwars-swg, Starwars-swtor</addr-line>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Université de Montpellier</institution>
          ,
          <addr-line>163 rue Auguste Broussonnet 34090 Montpellier</addr-line>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>University of Jean Jaurès</institution>
          ,
          <addr-line>Campus Mirail 5, 5 Allées Antonio Machado, 31058 Toulouse</addr-line>
        </aff>
        <aff id="aff4">
          <label>4</label>
          <institution>University of Toulouse Capitole</institution>
          ,
          <addr-line>2 Rue du Doyen Gabriel Marty, 31000 Toulouse</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>Entity matching is a critical task in integrating and linking entities across diferent Knowledge Graphs (KGs). Each entity matching task involves a pair of KGs, and the nature of these KGs, such as their size, schema, data quality, and domain, can categorize them into diferent Linking Problem Types (LPTs). Selecting the most appropriate matcher for diferent types of LPTs can substantially enhance the accuracy and efectiveness of entity matching. This research aims to empirically evaluate matchers for each LPT and develop a framework to systematically associate matchers with specific LPTs, enhancing both accuracy and eficiency in the entity matching process.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
    </sec>
    <sec id="sec-2">
      <title>2. Methodology</title>
      <sec id="sec-2-1">
        <title>Predicate value format value type LPT 5.7</title>
      </sec>
      <sec id="sec-2-2">
        <title>Graph scalability Problem</title>
        <sec id="sec-2-2-1">
          <title>Matcher Evaluation</title>
          <p>To empirically evaluate the matchers, we take the pairs of KGs associated with each LPT and assess
the performance of each matcher on these pairs, calculating the average precision (prec.), recall (rec.),
and F-measure (fm.) across the pairs. This helps identifying the most efective matcher for a given LPT.
Table 2 shows the performance of each matcher on each KG pair of Table 1 and sums-up their average
performance.</p>
          <p>We intentionally removed the KG pair “Starwars-swtor" KG pair from the evaluation process to use
it as a test case. Note that the best matching results for the pair “Starwars-swtor" was achieved using
BaselineAltLabel (fm. of 0.91).</p>
          <p>Matcher</p>
          <p>Pair
BaseLineLabel1
BaseLineAltLabel1</p>
        </sec>
        <sec id="sec-2-2-2">
          <title>Framework Development</title>
          <p>The framework will utilize Algorithm 1 to systematically select the optimal matcher for each pair of
KGs associated with specific LPTs. This process involves comparing the average performance scores
of various matchers across the LPTs linked to the input KG pair and selecting the matcher with the
highest score.</p>
          <p>Example Execution of Algorithm 2 Consider the KG pair “Starwars-swtor" with LPTs 1.1.1.2 and 5.7.
For these LPTs, the overall performance of each matcher is computed as:
1. BaseLineLabel Average Precision = 0.935, Average F-measure = 0.73, Average Recall = 0.606.
2. BaseLineAltLabel Average Precision = 0.8875, Average F-measure = 0.7865, Average Recall =
0.715.</p>
          <p>3. LogMap Average Precision = 0.8885, Average F-measure = 0.73, Average Recall = 0.6225.
1These matchers utilizes respectively rdfs:label and skos:altLabel for matching entities.</p>
          <p>To determine the best matcher, we compare the average F-measure scores. In this case,
BaseLineAltLabel has the highest average performance. This outcome aligns with the initial performance results
showing the algorithm’s utility in selecting the best matcher.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Conclusion and Future Work</title>
      <p>This research introduces a framework that systematically aligns specific LPTs with the most appropriate
entity matching algorithms. Future work will include expanding the matcher evaluation phase to
incorporate new pairs of KGs associated with additional LPTs and exploring the integration of other
advanced matchers.</p>
    </sec>
    <sec id="sec-4">
      <title>Acknowledgment References</title>
      <p>This work is partially supported by the French National Research Agency ANR DACE-DL project, grant
number ANR-21-CE23-0019.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>R. Conde</given-names>
            <surname>Salazar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Jonquet</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Symeonidou</surname>
          </string-name>
          ,
          <article-title>Classification of Linking Problem Types for linking semantic data</article-title>
          ,
          <source>in SEMANTICS 2023 - 9th International Conference on Semantic Systems</source>
          , Leipzig, Germany, Sep.
          <year>2023</year>
          , IOS Press, https://hal.science/hal-04206689, DOI: 10.3233/SSW230014.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Jiménez-Ruiz</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Cuenca Grau</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          (
          <year>2011</year>
          ).
          <article-title>LogMap: Logic-Based and Scalable Ontology Matching</article-title>
          . In L. Aroyo,
          <string-name>
            <given-names>C.</given-names>
            <surname>Welty</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Alani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Taylor</surname>
          </string-name>
          , A.
          <string-name>
            <surname>Bernstein</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Kagal</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Noy</surname>
          </string-name>
          , &amp; E. Blomqvist (Eds.),
          <source>The Semantic Web - ISWC</source>
          <year>2011</year>
          (pp.
          <fpage>273</fpage>
          -
          <lpage>288</lpage>
          ). Springer Berlin Heidelberg. ISBN 978-3-
          <fpage>642</fpage>
          -25073-6.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Sharma</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jain</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Patel</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          (
          <year>2024</year>
          ).
          <article-title>Large Scale Ontology Matching System (LSMatch)</article-title>
          .
          <source>Recent Advances in Computer Science and Communications</source>
          ,
          <volume>17</volume>
          (
          <issue>2</issue>
          ),
          <fpage>20</fpage>
          -
          <lpage>30</lpage>
          . ISSN:
          <fpage>2666</fpage>
          -
          <lpage>2566</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>