<!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>Interpretable Entity Matching with WYM</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Andrea Baraldi</string-name>
          <email>andrea.baraldi96@unimore.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Francesco Del Buono</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Francesco Guerra</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Giacomo Guiduzzi</string-name>
          <email>giacomo.guiduzzi@unimore.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Matteo Paganelli</string-name>
          <email>pagamatteo@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Maurizio Vincini</string-name>
          <email>maurizio.vincini@unimore.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Modena and Reggio Emilia</institution>
          ,
          <addr-line>Via P. Vivarelli 10, Modena (MO)</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper introduces WYM (Why do You Match?), an intrinsically explainable model designed for Entity Matching (EM). WYM is built upon decision units, which are basic information units formed by either pairs of similar terms belonging to diferent entity descriptions, or unique terms present in only one of the descriptions. Decision units enable the definition of a new feature space that can compactly and meaningfully represent pairs of entity descriptions. By training an explainable binary classification model on these features, WYM generates customized and efective explanations for EM datasets.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;XAI</kwd>
        <kwd>Entity Matching</kwd>
        <kwd>Machine Learning</kwd>
        <kwd>Deep Learning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        explanations can result in usability issues. Specifically, records may contain a significant number
of features, leading to complex explanations that are challenging to manage and comprehend
for users [
        <xref ref-type="bibr" rid="ref13 ref8">13, 8</xref>
        ]. Moreover, records representing matching entities are prone to a high level of
duplicated terms, making the explanations dificult to read and interpret. To resolve this issue,
it is necessary to specify which entity description the duplicated features belong to, i.e., either
the left entity or the right entity, to avoid confusion and uncertainty in feature weights.
      </p>
      <p>
        To address the challenges of EM model interpretability, we proposed WYM [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] (Why do
You Match?), an intrinsically explainable EM model based on “decision units". Decision units are
intuitive information units that acknowledge records as pairs of entity descriptions. They can
be either paired or unpaired. Paired decision units consist of semantically similar features (i.e.,
tokenized words in the case of textual datasets) found in the descriptions of diferent entities,
while unpaired decision units represent isolated features from an entity description that lack a
corresponding feature in the other description. By using decision units as the feature space for
training an intrinsically explainable EM model, WYM ofers a more intuitive and interpretable
explanation for its decisions. The core of WYM consists of three main components: the Decision
unit generator, which computes the decision units from the dataset records; the Decision unit
relevance scorer, which assigns weights (relevance scores) to each decision unit based on its
importance in the matching decision; and the Explainable matcher, which computes the match
prediction and generates the explanations by associating a contribution score to each decision
unit. An additional component, the Explanation analysis tool, is in charge of analyzing the results
of the Explainable matcher for generating counterfactual (i.e., explanations where the smallest
change to the feature values flips the prediction to the opposite output [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]) and exemplary (i.e.,
a subset of representative explanations from the ones from the entire dataset) explanations.
      </p>
      <p>
        This paper is an extended abstract of paper [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] where the efectiveness of decision units in
providing an explanation for the results of an EM model is introduced.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. The WYM Explainable Matcher</title>
      <p>The WYM functional architecture for generating intrinsically interpretable predictions for
entity descriptions is shown in Figure 1. It comprises four main components: the Decision unit
generator, the Relevance scorer, the Explainable matcher, and the Explanation analysis tool. In the
following, we suppose that entity descriptions share the same schema.</p>
      <sec id="sec-2-1">
        <title>Decision unit generator.</title>
        <p>This component implements three main functionalities. Firstly, a word-piece tokenization with
stop word removal is applied. Then we apply the BERT language model (fine-tuned for the
task at hand) to encode the meaning of the entity descriptions into contextualized embeddings.
Finally, embeddings from an entity description are possibly paired with the ones of the second
description, thus forming paired decision units. For this last operation, we leverage the schema
of the dataset, if any, to reduce the alignment space where an adaptation of the Gale–Shapley
implementation of the Stable Marriage algorithm is applied.</p>
        <p>Example. Let us consider the dataset iTunes-Amazon dataset from the Magellan benchmark.</p>
        <p>x2cu
everything is 4</p>
        <p>pop music
2015 warner bros record inc.</p>
        <p>Optimized Stable
Marriage on BERT
word embeddings
x2cu jason derulo
everything is 4 clean pop
$1.29 2011 because music</p>
        <p>Decision unit
generator</p>
        <p>Paired</p>
        <p>x2cu
everything is 4</p>
        <p>pop music
2015 warner bros. records inc.</p>
        <p>Counterfactual
Explanation</p>
        <p>x2cu
everything is 4 clean</p>
        <p>pop
2011 because music</p>
        <p>The goal is to understand when descriptions refer to the same song and the impact of the decision
units in the prediction. The Decision unit generator takes the descriptions in the dataset as
input as shown in the left part of Figure 1 and generates paired and unpaired decision units.
The Figure shows two examples of paired and unpaired units. Among them, [x2cu,x2cu],
the name of the song, is an example of paired decision unit, [clean], a word that is part of the
album title in the second description, is an example of an unpaired decision unit.</p>
      </sec>
      <sec id="sec-2-2">
        <title>Decision unit relevance scorer.</title>
        <p>To assign relevance scores to decision units in the matching process, WYM utilizes a supervised
regression model trained using a dataset where each entry represents a decision unit, and the
target class is estimated by applying a heuristic rule, which relies on the class to which the
decision unit belongs and the frequency of co-occurrence of the decision unit to the target class
computed on the entire dataset.</p>
        <p>Example. The relevance score assigned to the paired decision unit [x2cu,x2cu] is 0.822, thus
pushing WYM to consider the descriptions as matching. The score of the unpaired decision unit
[clean] is -0.149, thus pushing the classifier to consider the descriptions as non-matching.</p>
      </sec>
      <sec id="sec-2-3">
        <title>Explainable matcher</title>
        <p>The relevance scores assigned to the decision units provide an estimate of their contribution to
the overall prediction. We enhanced this estimation by incorporating contextual and structural
knowledge. We introduced three types of knowledge by aggregating features and scores based
on attribute, entity description, and record. To accomplish this, we employed various statistical
operators such as max, min, and count, which were applied to the decision units. The new dataset
is used to train a binary classifier (a logistic regression classifier) that infers if the pairs of entity
descriptions refer to the same real-world entity. Finally, we leverage the interpretability of the
selected binary classifier to estimate the efect that each decision unit has on the prediction. We
begin by extracting the learned coeficients from the classifiers, which indicate the importance
of each generated feature. Next, we employ an inverse feature engineering transformation to
identify the units that contribute to each feature and associate them with the impact score.
(a) The explanation computed by WYM.</p>
        <p>(c) Counterfactual explanation (matching).
(b) Comparison with token-based explanation.</p>
        <p>(d) Counterfactual explanation (non-matching).</p>
        <p>
          Example. The classifier generates the prediction (a match in the example of Figure 1, with a
probability score of 0.999) and the application of inverse transformations to its output generates
the explanation, i.e. the impact of each decision unit in the prediction. We observe that
the units that mostly contribute to the predictions are [x2cu,x2cu] and [5:13,5:14] and
that, for example, the term ‘because’, with a score of -0.578, pushes the classifier to a
nonmatching prediction. Figure 2a shows the WYM GUI with the impact scores, which represent the
contribution score of each decision. Note that if we sum all them along with the intercept of the
LR and we apply the sigmoid function we obtain the exact prediction of WYM. In other words,
the impact score is the impact of a decision unit as part of the EM record before the application
of the sigmoid. Figure 2b ofers a comparison with the explanation computed by LIME coupled
with DITTO. Even if our experiments in Section 3 show that DITTO achieves better accuracy
than WYM in the dataset, the explanation provided by LIME is less interpretable[
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. For
example, LIME computes two diferent impact values for the token [x2cu] that in WYM is
represented by a paired decision unit. Managing tokens with diferent impacts can be misleading
for users who cannot easily understand the real impact of the terms in the descriptions.
        </p>
      </sec>
      <sec id="sec-2-4">
        <title>Explanation analysis tool.</title>
        <p>Tools for the analysis of the explanations allows the users to analyze the importance of the
decision units (also comparing them to token-based explanations generated for the same entity
descriptions) and to generate counterfactual and exemplary explanations. Counterfactual
explanations allow users to identify key features for the matching decision and to improve the
accuracy of the EM model. The technique for computing counterfactual explanations changes
in case of predictions of matching / non-matching entities. A simple heuristic for matching
entity descriptions is to remove decision units from the explanation in descending order by
impact and generate new prediction scores. The process iterates until the prediction changes to
non-matching. Counterfactual explanations may lack meaning when applied to non-matching
entities, particularly when the entities are vastly dissimilar, and the inclusion of additional
features to establish a match would result in a significant alteration of the original description.</p>
        <p>WYM implements the following heuristics to generate counterfactual explanations for
matching entity descriptions: MoRF : the Most Relevant Features are removed first, thus allowing
the users to identify the features needed for the explanation. A probabilistic variation of the
MoRF heuristic is also implemented to generate many counterfactual explanations for the same
record; LeRF : the Least Relevant Features are removed first, thus allowing the users to identify
the features which are suficient for the explanation. A probabilistic variation of the LeRF
heuristic, generating many explanations for the same record, is also implemented; random: the
features are randomly removed, thus generating reference baselines; manual: the user selects
the decision units to remove.</p>
        <p>Example. Figure 2c shows a counterfactual example generated by WYM with the MoRF strategy
from the same prediction introduced in Scenario 1. The left part of the Figure shows the original
pair of entity descriptions. On the right, we show the counterfactual explanation where the
title and the duration of the song are removed. This means that selected units in the title and
duration assume paramount importance in the prediction. The user can select other heuristics
and the results are shown with the same tabular representation.</p>
        <p>To compute counterfactual explanations for a pair of non-matching entity descriptions, WYM:
1) extracts from it the positive explanation, which only includes the “positive” decision units
making the entity descriptions refer to the same real-world entity; 2) injects “negative” decision
units into the positive explanation until the prediction changes again to non-matching. Since
the goal is to identify the features that maximize the diversity between the descriptions, the
most negative decision units are injected firstly.</p>
        <p>Example 3. Figure 2d shows a counterfactual example for a non-matching entity prediction. The
removal of unpaired decision units from the song title of both descriptions and from the genre
of the first entity description makes WYM change the prediction class. This counterfactual
explanation is consistent with the previous (and it is something somewhat expected from our
domain knowledge): the terms in the song title are the ones that lead the model to understand
if descriptions refer to the same real song.</p>
        <p>
          Finally, the WYM system ofers a feature that automatically identifies exemplary explanations
from the ones generated for the entire dataset. These explanations are evaluated based on their
ability to jointly satisfy three key metrics: explanation entropy, prediction-relevant units, and
explanation overlap. Firstly, the explanation entropy metric is used to gauge the balance of token
impacts in an explanation. An explanation with a low entropy (i.e., an unbalanced distribution of
token impacts) is more intriguing than one with a high entropy (i.e., a near-uniform distribution),
as it helps users identify the most significant units for prediction more easily. Secondly, the
prediction-relevant units metric is used to evaluate the relevance of the decision units for the
prediction, with a preference for a lower percentage of units that are relevant for prediction,
as this provides a more concise and usable interpretation of the model’s behavior. Lastly,
the explanation overlap metric is used to examine sets of explanations with complementary
characteristics, such as explanations with diferent decision unit impact distributions at the
attribute level, to achieve a more comprehensive interpretation of the EM model’s behavior.
The user can specify the weight of each metric in the selection of emblematic explanations, and
the Smooth Local Search technique [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] is applied to optimize the selection process.
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Experimental evaluation</title>
      <p>
        In this reduced extended abstract, the experimental evaluation focuses on demonstrating 1)
how efective is WYM in solving EM tasks (Section 3.1) and 2) if the impact scores provide a
reliable interpretation of the EM predictions (Section 3.2). Interested readers can refer to the
paper [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] and the GitHub project at https://github.com/softlab-unimore/WYM for a complete
experimental evaluation of the approach.
      </p>
      <p>Datasets. The experiments are performed against 12 datasets provided by the Magellan library1
which are usually considered the reference benchmark for the evaluation of EM tasks. In Table 1,
we show some of their descriptive statistics: the total number of records representing matching
entities in the fourth column and the percentage of records associated with a matching label in
the last column. For the purposes of the experimental evaluation, each dataset is divided into
training, validation, and test set which were created with 60-20-20 proportions.</p>
      <sec id="sec-3-1">
        <title>3.1. Efectiveness of the EM Model</title>
        <p>
          The efectiveness of WYM against the datasets in the benchmark in terms of F1 score is computed.
The results are compared with the results achieved by DeepMatcher+2 (DM+) , one of the
pioneering EM systems based on Deep Learning, AutoML [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ], an approach that provides the
automatic application of ML models to the EM problem by pipelining AutoML systems with
transformer-based encoders, CorDEL [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ] and DITTO [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ], a contrastive DL approach and a
BERT-based approach currently representing the state-of-the-art systems for solving the EM
tasks. The results are shown in Table 2.
1https://github.com/anhaidgroup/deepmatcher/blob/master/Datasets.md
2DM+ is the combination of experiments / implementations as defined in [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ]
Discussion. The overall WYM performance is slightly better than DM+, similar to AutoML and
CorDEL, and worse than DITTO. The average F1 score measured on the overall benchmark is
0.852 (WYM), 0.83 (DM+), 0.843 (AutoML), 0.861 (CorDEL) and 0.927 (DITTO). If we consider a
threshold of ± 3% from the result achieved by our approach, where we consider the results to be
similar, we observe that WYM performs better than DM+ in 4 datasets, worst in 1 dataset, and
within the threshold in the remaining 7 datasets; it performs better than AutoML in 4 datasets,
worst in 3 datasets, and within the threshold in the remaining 5 datasets; better than CorDEL in
2 datasets, worst in 3 and within the threshold in the remaining 7 datasets; finally, it performs
worse than DITTO in 7 datasets, and within the threshold in the remaining 5 datasets. The
detailed error analysis showed that WYM makes a large number of errors in recognizing product
codes in the entity descriptions. In many cases, they form a decision unit even if they are not
the same. This is mainly due to the tokenization mechanism introduced by BERT. Heuristics
can be applied to address the problem. In particular, we verified an improvement of the F1 score
in the T-AB dataset (from 0.645 to 0.754) after the insertion of domain knowledge that allows
only equal product codes to belong to the same paired decision units.
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Reliability of explanations</title>
        <p>To evaluate the contribution of the impact scores assigned to the decision units to the overall
accuracy of WYM, this experiment perturbs the dataset records by removing selected decision
units and analyzing the performance variations on these synthetic datasets. We experiment
with three techniques for the removal of the decision units applied to the datasets: 1) MoRF,
where we eliminate for each record the k decision units that contribute most to the prediction
(i.e. units with high positive impact in records describing matching entities and units with high
negative impact for non-matching), 2) LeRF, where the k decision units that contribute less
to the prediction are removed (i.e. high negative impact in case of entity matches and high
positive impact / in case of non-matches), and 3) Random, where k random decision units are
removed. We expect that when we remove the most relevant decision units (MoRF) from records
describing matching entities, the efectiveness (F1 score) will decrease; on the other hand, the
model should not be afected by the removal of the least relevant units first (LeRF). The results
of the experiment are shown in Figure 3, where, for each dataset, the F1 score generated by
WYM as the removal technique varies, is reported.</p>
        <p>Discussion. Analyzing the results we observe how impact scores assigned by WYM reflect
the real importance of each token on the prediction. By perturbing the data with the MoRF
strategy, WYM performance drops drastically (up to 60% in some datasets). The phenomenon is
mostly marked as the number of removed units increases, however, in some datasets (such as
Abt-Buy, Amazon-Google, and the two versions of Walmart-Amazon) the performance drops
after the removal of a single unit. Moreover, the LeRF perturbation does not produce substantial
variations in performance, which in most of the datasets slightly improves.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusion</title>
      <p>
        We presented WYM, i.e. an approach for performing interpretable entity matching that predicts
if a pair of entity descriptions refer to the same real-world entity, and provides the terms (i.e.,
the decision units) that mainly led to the decision. As already pointed out in the literature [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ],
providing interpretability to the predictions comes with the price of decreasing the efectiveness
of the approach. We consider WYM as a good compromise between the quality of the predictions
and the capability of interpreting them. Other approaches for explainable EM (e.g., DITTO)
definitely achieves the best performance, but acts for the users as an oracle that does not provide
any support for understanding the reasons for its decisions. WYM obtains high quality results
and provides decision units with the impact scores that can easily explain the predictions.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>U.</given-names>
            <surname>Gadiraju</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Anand</surname>
          </string-name>
          ,
          <article-title>Dissonance between human and machine understanding</article-title>
          ,
          <source>Proc. ACM Hum. Comput. Interact</source>
          .
          <volume>3</volume>
          (
          <year>2019</year>
          )
          <volume>56</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>56</lpage>
          :
          <fpage>23</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M.</given-names>
            <surname>Du</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <article-title>Techniques for interpretable machine learning</article-title>
          ,
          <source>Commun. ACM</source>
          <volume>63</volume>
          (
          <year>2020</year>
          )
          <fpage>68</fpage>
          -
          <lpage>77</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>Paganelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. D.</given-names>
            <surname>Buono</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Baraldi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Guerra</surname>
          </string-name>
          ,
          <article-title>Analyzing how BERT performs entity matching</article-title>
          ,
          <source>Proc. VLDB Endow</source>
          .
          <volume>15</volume>
          (
          <year>2022</year>
          )
          <fpage>1726</fpage>
          -
          <lpage>1738</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M. T.</given-names>
            <surname>Ribeiro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Guestrin</surname>
          </string-name>
          ,
          <article-title>" why should i trust you?" explaining the predictions of any classifier</article-title>
          ,
          <source>in: Proceedings of the 22nd ACM SIGKDD</source>
          ,
          <year>2016</year>
          , pp.
          <fpage>1135</fpage>
          -
          <lpage>1144</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>A.</given-names>
            <surname>Ghorbani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. Y.</given-names>
            <surname>Zou</surname>
          </string-name>
          ,
          <article-title>Data shapley: Equitable valuation of data for machine learning</article-title>
          ,
          <source>in: ICML</source>
          , volume
          <volume>97</volume>
          ,
          <string-name>
            <surname>PMLR</surname>
          </string-name>
          ,
          <year>2019</year>
          , pp.
          <fpage>2242</fpage>
          -
          <lpage>2251</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>A.</given-names>
            <surname>Ebaid</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Thirumuruganathan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W. G.</given-names>
            <surname>Aref</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Elmagarmid</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ouzzani</surname>
          </string-name>
          , Explainer:
          <article-title>Entity resolution explanations</article-title>
          ,
          <source>in: 2019 IEEE 35th International Conference on Data Engineering (ICDE)</source>
          , IEEE,
          <year>2019</year>
          , pp.
          <fpage>2000</fpage>
          -
          <lpage>2003</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>V. D.</given-names>
            <surname>Cicco</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Firmani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Koudas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Merialdo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Srivastava</surname>
          </string-name>
          ,
          <article-title>Interpreting deep learning models for entity resolution: an experience report using LIME, in: aiDM@SIGMOD</article-title>
          , ACM,
          <year>2019</year>
          , pp.
          <volume>8</volume>
          :
          <fpage>1</fpage>
          -
          <issue>8</issue>
          :
          <fpage>4</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>N.</given-names>
            <surname>Barlaug</surname>
          </string-name>
          , Lemon:
          <article-title>Explainable entity matching</article-title>
          ,
          <source>IEEE Transactions on Knowledge and Data Engineering</source>
          (
          <year>2022</year>
          )
          <fpage>1</fpage>
          -
          <lpage>16</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>A.</given-names>
            <surname>Baraldi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. D.</given-names>
            <surname>Buono</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Paganelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Guerra</surname>
          </string-name>
          ,
          <article-title>Using Landmarks for Explaining Entity Matching Models</article-title>
          , in: EDBT,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>T.</given-names>
            <surname>Teofili</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Firmani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Koudas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Martello</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Merialdo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Srivastava</surname>
          </string-name>
          ,
          <article-title>Efective explanations for entity resolution models</article-title>
          , in: ICDE, IEEE,
          <year>2022</year>
          , pp.
          <fpage>2709</fpage>
          -
          <lpage>2721</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>A.</given-names>
            <surname>Baraldi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. D.</given-names>
            <surname>Buono</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Guerra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Paganelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Vincini</surname>
          </string-name>
          ,
          <article-title>An intrinsically interpretable entity matching system, in: EDBT, OpenProceedings</article-title>
          .org,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>C.</given-names>
            <surname>Molnar</surname>
          </string-name>
          ,
          <source>Interpretable Machine Learning</source>
          ,
          <year>2019</year>
          . https://christophm.github.io/ interpretable-ml-book/.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>S.</given-names>
            <surname>Thirumuruganathan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ouzzani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <article-title>Explaining entity resolution predictions: Where are we and what needs to be done?</article-title>
          , in: HILDA@SIGMOD, ACM,
          <year>2019</year>
          , pp.
          <volume>10</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>10</lpage>
          :
          <fpage>6</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>U.</given-names>
            <surname>Feige</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V. S.</given-names>
            <surname>Mirrokni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Vondrák</surname>
          </string-name>
          ,
          <article-title>Maximizing non-monotone submodular functions</article-title>
          ,
          <source>SIAM J. Comput</source>
          .
          <volume>40</volume>
          (
          <year>2011</year>
          )
          <fpage>1133</fpage>
          -
          <lpage>1153</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Suhara</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Doan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <article-title>Deep entity matching with pre-trained language models</article-title>
          ,
          <source>Proc. VLDB Endow</source>
          .
          <volume>14</volume>
          (
          <year>2020</year>
          )
          <fpage>50</fpage>
          -
          <lpage>60</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>M.</given-names>
            <surname>Paganelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. D.</given-names>
            <surname>Buono</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Pevarello</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Guerra</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. Vincini,</surname>
          </string-name>
          <article-title>Automated machine learning for entity matching tasks</article-title>
          , in: EDBT, OpenProceedings.org,
          <year>2021</year>
          , pp.
          <fpage>325</fpage>
          -
          <lpage>330</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Sisman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X. L.</given-names>
            <surname>Dong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ji</surname>
          </string-name>
          ,
          <article-title>Cordel: A contrastive deep learning approach for entity linkage</article-title>
          , in: ICDM, IEEE,
          <year>2020</year>
          , pp.
          <fpage>1322</fpage>
          -
          <lpage>1327</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>