<!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>Mitigating Unfairness in Machine Learning: A Taxonomy and an Evaluation Pipeline</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Discussion Paper</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Chiara Criscuolo</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tommaso Dolci</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mattia Salnitri</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Politecnico di Milano - Department of Electronics</institution>
          ,
          <addr-line>Information and Bioengineering</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>Big data poses challenges in maintaining ethical standards for reliable outcomes in machine learning. Data that inaccurately represent populations may result in biased algorithmic models, whose application leads to unfair decisions in delicate fields such as medicine and industry. To address this issue, many fairness mitigation techniques have been introduced, but the proliferation of overlapping methods complicates decision-making for data scientists. This paper proposes a taxonomy to organize these techniques and a pipeline for their evaluation, supporting practitioners in selecting the most suitable ones. The taxonomy classifies and describes techniques qualitatively, while the pipeline ofers a quantitative framework for evaluation and comparison. The proposed approach supports data scientists in addressing biased models and data efectively.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;fairness</kwd>
        <kwd>mitigation</kwd>
        <kwd>machine learning</kwd>
        <kwd>taxonomy</kwd>
        <kwd>pipeline</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>One of the challenges of big data is assuring high ethical standards to obtain reliable and
highquality results when machine learning algorithms are employed. Data that do not correctly
represent the population sooner or later lead to biased machine learning models and wrong
outcomes, with possible severe impacts on people and society. For example, a biased model
for evidence-based medicine may lead to wrong diagnoses, or a biased model for the industry
might lead to wrong business decisions. In both cases, consequences will be drastic, potentially
leading to life-threatening situations in the former case and to business failures in the latter. To
address this problem, fairness mitigation techniques can be used, to either modify the analyzed
data or tune the model, with the goal of reducing or removing bias. Because of the importance
of the issue, mitigation techniques are proliferating in the literature, frequently generating
overlapping techniques that make the choice of the the data scientist extremely dificult.</p>
      <p>Therefore, we propose a taxonomy to organize the fairness mitigation techniques that can be
used to mitigate bias. Such a taxonomy will help data scientists navigate through the diferent
mitigation techniques and easily identify the ones that can be applied to the specific context.
To further help the selection of mitigation techniques, this paper proposes a pipeline for their
evaluation, whose objective is to be used for the creation of a shared repository of evaluations
that can grow incrementally and become a reference knowledge-base.</p>
      <p>The rest of the paper is structured as follows. Section 2 reports the theoretical foundations of
the research work, and Section 3 describes the state of the art on taxonomies for unfairness
mitigation techniques and pipelines for their evaluation. Section 4 introduces the proposed
taxonomy, with an example of a structured description focused on one unfairness mitigation
technique, while Section 5 illustrates the evaluation pipeline. Finally, Section 6 concludes the
paper and discusses future works.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Preliminaries</title>
      <p>
        Fairness is “the absence of any prejudice or favoritism toward an individual or a group based
on their inherent or acquired characteristics” [1, p.100]. It is based on the idea of protected
or sensitive attribute. A protected attribute is a characteristic for which non-discrimination
should be established, such as religion, race, sex, and so on [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. A protected group is a set of
individuals identified by the same value of a protected attribute (e.g., females, young people,
Hispanic people). Fairness can be measured with diferent metrics [
        <xref ref-type="bibr" rid="ref2 ref3 ref4">2, 3, 4</xref>
        ], each one expressing
a specific aspect of fairness. Fairness can be considered satisfied based on the values of the
aforementioned metrics.
      </p>
      <p>
        The process to identify, measure and mitigate unfair behaviors of machine learning models
is composed of three steps [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]: (i) train a classification algorithm to predict the binary value
of the target class, that can be a positive or a negative outcome like not obtaining a loan or
having a low income; (ii) use fairness metrics to understand whether the prediction of this
model encompasses discrimination for the protected group; (iii) if the metrics results show
unfair behavior, we conclude that the model learned the bias from the dataset, and a fairness
mitigation technique is applied.
      </p>
      <p>
        A fairness mitigation technique falls into one of the following three main categories [
        <xref ref-type="bibr" rid="ref6 ref7">6, 7</xref>
        ]:
• Pre-processing: tackle the fairness problem by removing the underlying discrimination
from the training dataset, before the model is trained;
• In-processing: modify state-of-art algorithms to address fairness during the learning
phase;
• Post-processing: act after the training phase has ended, by transforming the model
output to satisfy fairness.
      </p>
      <p>In the rest of the paper, we adopt the following terminology:
• : the original dataset composed by  tuples;
• : the trained algorithm classifier;
• : the protected attribute;
•  : the actual classification result, two possible values (or labels);
• ^ : the algorithm predicted decision;
• ′, ^′ and ′ are the corresponding values after the application of a mitigation technique.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Related Work</title>
      <p>In the recent years, numerous researchers have worked to provide a comprehensive overview
of unfairness mitigation techniques in computer science and machine learning.</p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] the authors present the various types of bias with examples of real-world
applications. They propose a taxonomy for fairness definitions from the literature to address bias
in machine-learning systems, categorizing them based on their downstream application (i.e.,
classification, regression, and other machine-learning methods). In [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] the authors give an
overview of the main concepts of fairness, considering identification, measurement, and
improvement of fairness, focusing solely on classification tasks. They briefly present various
fairness-enhancing algorithms dividing them into pre-, in-, and post-processing techniques.
A similar approach is adopted in [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], with the diference that pre-, in-, and post-processing
algorithms are further sub-categorized into areas to provide a deeper insight. In [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], bias and
unfairness are analyzed in various domains, primarily focusing on data management approaches
to address unfairness. They cover the definitions of fairness metrics, how to identify
unfairness, and mitigation techniques. The author suggest a shift towards a data-centered approach,
by integrating bias constraints and curation methods into database management systems, to
discover and mitigate bias as early as possible. In [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], the authors provide an overview of
bias-mitigation research across various algorithmic systems, focusing on information retrieval,
human-computer interaction, recommender systems, and machine learning. Additionally, they
discuss the subjective nature of perceived fairness and the importance of explainability in
managing bias. The survey identifies two types of attributes afected by bias: those describing
the world and those describing information, suggesting diferent approaches for mitigation.
      </p>
      <p>What emerges from this work is the need for an up-to-date and comprehensive taxonomy that
presents and describes unfairness mitigation techniques, highlighting, through specific selection
criteria, which ones are available of-the-shelf and readily usable . Our taxonomy addresses this
gap, focusing on the qualitative aspects necessary for understanding and choosing the right
technique to apply.</p>
      <p>
        Finally, in [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] the authors present a data pre-processing pipeline to facilitate a direct
comparison of mitigation techniques: they suggest a standard dataset pre-processing method and study
the trade-of evaluation between fairness and accuracy. Our evaluation pipeline difers from
this approach in comparing, through fairness metrics, the impact of each mitigation strategy.
      </p>
    </sec>
    <sec id="sec-4">
      <title>4. Taxonomy of Mitigation Techniques</title>
      <p>The first part of this section presents the taxonomy structure, the selection criteria, and its
overall composition. The second part describes in detail the taxonomy elements. Finally, we
present a structured description of a specific mitigation technique included in the taxonomy.</p>
      <sec id="sec-4-1">
        <title>4.1. Taxonomy Definition</title>
        <p>We propose a taxonomy that classifies unfairness mitigation techniques based on the targeted
processing phase of machine learning models. Each technique is classified into pre-, in- and
post-processing classes. The usefulness of the proposed taxonomy is based on the amount of
mitigation techniques that are included. The taxonomy can be seen as the result of systematic
analyses of the state of the art, that can be cyclically performed by data scientists to include
more and more techniques. We, therefore, envision the taxonomy to be constantly updated
and extended. As a result, we designed it to be easily extensible, by following the classification
proposed and including the required information for the structured description of the technique.</p>
        <p>The choice of the mitigation techniques that are included in the taxonomy is based on the
following selection criteria.</p>
        <p>• Applicability: the mitigation technique should be usable of-the-shelf, with parametric
customization only. Many prototypical mitigation techniques are available, yet their
application is limited to specific cases, or they need heavy customization. Such an efort
is not feasible for data scientists in most scenarios.
• Tabular data: tabular data is the most used type of data, especially in data science
applications. The selected mitigation techniques are required to operate on tabular data.</p>
        <p>In some cases (e.g., waveforms) unstructured data can be transformed into tabular data.
• Binary classification : the selected mitigation techniques are required to mitigate bias
for binary classification models. In particular, we restrict the scope to techniques that
apply to prescriptive models, and guarantee fair, unbiased predictions.</p>
        <p>Each element of the taxonomy is a mitigation technique, that is detailed using a predefined
description structure that will guide the inclusion of new mitigation techniques, and ease the
analysis of the taxonomy and of the included techniques.</p>
        <p>General Description. This is a general description of the mitigation technique, that is used to
provide the data scientists with the context of application of the technique.</p>
        <p>Objectives. This field defines the objective and the scope of the mitigation technique. We
describe and summarize the main steps of each technique, to make the technique more
understandable.</p>
        <p>Input Required. This specifies the type of input required by the mitigation technique: some
techniques require specific information or pre-processing steps to make the dataset compliant
with the requirements of the mitigation technique, e.g., if the dataset contains only categorical
values. This field specifies the pre-processing actions possibly required by the technique.
Expected Output. The expected results are specified in this field. For instance, some techniques
return a modified version ′ of the input dataset, others an improved classifier ′.
Parameters. This field contains the number and types of parameters that need be specified
for the mitigation techniques. A short description of each parameter is provided, including
procedures for the identification of the best parameter values and instructions on fine-tuning.
If the parameters are context-dependent, this is also reported.</p>
        <p>Issues and Limitations. This field specifies the known limitations of the mitigation technique
and also possible issues experienced in its application. Possible issues relate to: (i) machine
learning support, i.e., any constraints with machine learning models, cross-validation or
holdout support; (ii) required post-processing of the mitigation output to compare it with the original
dataset; (iii) the possibility of retrieving (or not) the modified dataset (if any).
Demonstration of Application. This provides a link to a working demonstration, if any. A
working demonstration is central to understand how the technique is applied and can operate.</p>
        <sec id="sec-4-1-1">
          <title>Category</title>
          <p>Pre-proc.
In-proc.</p>
          <p>Post-proc.</p>
        </sec>
        <sec id="sec-4-1-2">
          <title>Technique</title>
          <p>Reweighing
Disparate Impact Remover
Learning Fair Representation</p>
          <p>Optimized Pre-processing</p>
          <p>Correlation Remover
Adversarial Debiasing</p>
          <p>Prejudice Remover</p>
          <p>Reductions Exponential Gradient
Calibrated Equalized Post-Processing</p>
          <p>Reject Option Classification
Equalized Odds Post-Processing</p>
          <p>Threshold Optimizer</p>
          <p>Input
, , 
, , 
, , 
, , 
, , 
, , 
, , 
, , 
, , , ^
, , , ^
, , , ^
, , , ^</p>
          <p>Output
′, 
′
′
′
′
′
′
′
^′
^′
^′
^′</p>
          <p>
            Ref.
[
            <xref ref-type="bibr" rid="ref13">13</xref>
            ]
[
            <xref ref-type="bibr" rid="ref14">14</xref>
            ]
[
            <xref ref-type="bibr" rid="ref15">15</xref>
            ]
[
            <xref ref-type="bibr" rid="ref16">16</xref>
            ]
[
            <xref ref-type="bibr" rid="ref17">17</xref>
            ]
[
            <xref ref-type="bibr" rid="ref18">18</xref>
            ]
[
            <xref ref-type="bibr" rid="ref19">19</xref>
            ]
[
            <xref ref-type="bibr" rid="ref20">20</xref>
            ]
[
            <xref ref-type="bibr" rid="ref21">21</xref>
            ]
[
            <xref ref-type="bibr" rid="ref22">22</xref>
            ]
[23]
          </p>
          <p>Source Code. This specifies the link to the source code, if available.</p>
          <p>Documentation. This specifies the link to the oficial documentation or any other useful
documentation of the technique.</p>
        </sec>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. An Overview of the Proposed Taxonomy</title>
        <p>
          Table 1 shows a general overview of the taxonomy, considering some mitigation techniques,
presenting: the name of each technique, its category, the required input, and the expected output.
The selected techniques satisfy all the criteria mentioned at the beginning of Section 4.1, i.e., the
possibility of applying this mitigation technique to tabular data in a binary classification task.
The two additional columns Ref. and Tool report the original paper in which the mitigation
technique was first proposed, and which tool provides a library/source code available to use
the specific mitigation technique. Two main tools are considered: AIF360 [24], the acronym for
AI Fairness 360 tool implemented by IBM, and FL standing for FairLearn [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ], implemented by
Microsoft. Other state-of-the-art tools were discarded because they ofered only methodologies
for measuring fairness and not for its mitigation, such as Aequitas tool [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ], Google What-if
tool [25].
        </p>
        <p>
          The following part reports, as an example, the structured description of Reweighing [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ], a
mitigation technique included in the taxonomy described in Table 1. This technique fits the
selection criteria of the presented taxonomy: (i) it is applicable and of-the-shelf, (ii) it handles
        </p>
        <sec id="sec-4-2-1">
          <title>Tool</title>
          <p>AIF360
AIF360
AIF360
AIF360</p>
          <p>FL
AIF360, FL</p>
          <p>AIF360
FL, AIF360</p>
          <p>AIF360
AIF360</p>
          <p>
            FL
[
            <xref ref-type="bibr" rid="ref21">21, 23</xref>
            ] FL, AIF360
tabular data, and (iii) it can be used to mitigate unfairness also for binary classification tasks.
General Description The intuition behind this strategy is that new weights are assigned to
data objects (tuples) to make the dataset discrimination-free. [13, p.14].
          </p>
          <p>
            Objectives The goal of Reweighing is to assign a weight to the tuple in the dataset, in a way
that the new dataset ′ is bias-free, i.e.,  the protected attribute and  the target variable, are
statistically independent [
            <xref ref-type="bibr" rid="ref13">13</xref>
            ]. More specifically, the proposed equation is:
 () =
( = () ∧  = ( ))
( = () ∧  = ( ))
,
where  is a protected attribute,  is the target variable and  is a random unlabelled data
object. If the expected probability is higher than the observed probability value, it shows the bias
toward class, thus the technique assigns lower weights to individuals who have been deprived
or favored. If we multiply the frequency of every tuple by its weight, the new dataset will be
bias-free.
          </p>
          <p>Required Input The required input is composed by the original dataset , the protected
attribute , and the target class  . There are no further requirements for the input.
Output Expected The expected output is composed of a mitigated dataset ′ and a weight
vector  .</p>
          <p>Parameters This technique has no parameters to set.</p>
          <p>Issues and Limitations The main issue of this technique is the output: the mitigated dataset
′ is equal to the original one , but every tuple will have a diferent weight based on the
protected attribute and the classification label. To apply the technique, the researcher should
use the weight vector  . This vector should be used in the training and testing phases of the
new model, in order to apply  to ′ to obtain a mitigated solution.</p>
          <p>Demonstration of Application A demonstration of Reweighing can be found here: https:
//github.com/Trusted-AI/AIF360/blob/master/examples/demo_reweighing_preproc.ipynb.
Source Code The source code of Reweighing is available here: https://github.com/Trusted-AI/
AIF360/blob/main/aif360/algorithms/preprocessing/reweighing.py.</p>
          <p>Documentation The documentation of Reweighing is available here: https://aif360.readthedocs.
io/en/stable/modules/generated/aif360.algorithms.preprocessing.Reweighing.html.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Evaluation Pipeline</title>
      <p>This section presents an innovative approach to systematically test and compare various fairness
mitigation techniques from the literature. The proposed solution is designed to work with
any tabular dataset. Currently, research work of this kind focuses on a few standard datasets
from the literature (e.g., Adult Census Income, German Credit Risk Score, Compas Recidivism
Score), and the considered fairness measures are typically limited. For example, many papers
exclusively employ mitigation techniques implemented by AIF360, evaluating the results using
only the predefined fairness metrics provided by the tool. The pipeline proposed in this paper
allows to perform an evaluation using a larger set of metrics, each one derived from a diferent
fairness definition, not bounded to the specific technique under analysis.
data,
protected attribute,</p>
      <p>target class
Model Training
and Testing
predictions</p>
      <p>Evaluation Pipeline
fairness metrics</p>
      <p>Initial
Measurement
metrics
values</p>
      <p>Taxonomy
mitigation
technique</p>
      <p>Mitigation
predictions after
mitigation
Comparison
fairness metrics
After Mitigation
Measurement
metrics values</p>
      <p>Our pipeline stands out by considering a wide range of the most used fairness metrics,
distinguishing this approach from available of-the-shelf tools. Similarly, we encompass all
the mitigation techniques described in our taxonomy, not confining the evaluation to those
ofered by a single system. The overall goal is to lfil a gap in the literature by providing a
systematic evaluation of these techniques. This contribution is in addition to the systematic
screening provided by the taxonomy, which is a key first step in better understanding unfairness
mitigation techniques.</p>
      <p>
        Figure 1 illustrates the proposed pipeline to quantitatively assess and compare the
efectiveness of the mitigation techniques outlined in the taxonomy. Our pipeline, inspired by, and
enriched from [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], starts with the input dataset , in which a protected attribute  is identified.
We assume the dataset to be pre-processed by the researcher, to ensure data quality.
      </p>
      <p>The initial stage is Model Training and Testing, where a classification model  is trained on an
input dataset  with target class  . During testing, the model’s predictions ^ are computed.
,  and ^ represent the input to the Initial Measurement step to assess fairness. During
this step, the identified fairness metrics are evaluated and analyzed. If any unfair behavior is
detected, the Mitigation step is executed. Fairness mitigation techniques, selected on the basis
of the taxonomy specified in Section 4, are applied. The result is a new set of predictions ^′ for
each technique applied. Finally, a second measurement step (After Mitigation Measurement) is
executed to compute the new values for each fairness metric.</p>
      <p>An analysis of the fairness metrics values before and after the mitigation step allows to
compare the outcomes of the mitigation techniques. The analysis can be accompanied by the
generation of plots and graphs. These visualizations provide researchers with a comprehensive
understanding of the impact of each mitigation technique on the input dataset.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusions and Future Work</title>
      <p>This paper proposed an approach to help data scientists for the selection of the most suitable
unfairness mitigation techniques when biased datasets are employed. In particular, we proposed
two contributions: a taxonomy and an evaluation pipeline. The taxonomy allows the
classification and qualitative structured description of mitigation techniques. The evaluation pipeline
allows the quantitative evaluation and comparison of the efectiveness of the techniques. This
paper lays the basis for a more extensive method for the evaluation of fairness mitigation
techniques.</p>
      <p>Future work consists in considering how the techniques’ efectiveness is impacted by the
type of data used and the type of machine learning model applied. The consideration of
these variables is key for a deeper understanding of the eficacy of the fairness mitigation
techniques. Additionally, the selection of the fairness metrics used in Initial Measurement and
After Mitigation Measurement is central for a sound analysis. Unfortunately, of-the-shelf tools
provide a limited, and heterogeneous, amount of metrics. To overcome this limit, we intend to
implement a comprehensive set of metrics based on diferent fairness definitions.</p>
      <p>Finally, the pipeline presented in this paper defines a general approach, and therefore can
be extended and further detailed in each of the presented steps. For instance, the Mitigation
step is a complex process that varies according to the mitigation technique applied, while the
Measurement steps require a thorough analysis of each fairness metric. The Comparison step
is critical since it requires a complex analysis by the data scientists. As a future work, all the
mentioned steps can be improved to provide the scientists with: (i) support for the execution
of the mitigation techniques, (ii) guidelines for the selection of the fairness metrics, and (iii)
guidelines for the comparison of mitigation results. Overall, the evaluation pipeline can be
automated for a faster and more efective measurement.</p>
      <p>The contribution of this paper allows for an informed choice of fairness mitigation techniques.
It will guide data scientists on the selection process obviating the existing theoretical and
methodological gaps that, until today, lead to unacceptable errors and inaccuracies of machine
learning models caused by biased datasets.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgments References</title>
      <p>Thanks to professor Letizia Tanca for her contribution: her precious comments and feedback
have significantly improved this research work.
[23] M. Hardt, E. Price, N. Srebro, Equality of opportunity in supervised learning, NeurIPS 29
(2016).
[24] R. K. Bellamy, et al., Ai fairness 360: An extensible toolkit for detecting and mitigating
algorithmic bias, IBM Journal of Research and Development 63 (2019) 4–1.
[25] J. Wexler, M. Pushkarna, T. Bolukbasi, M. Wattenberg, F. Viégas, J. Wilson, The what-if
tool: Interactive probing of machine learning models, IEEE transactions on visualization
and computer graphics 26 (2019) 56–65.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>N. A.</given-names>
            <surname>Saxena</surname>
          </string-name>
          , et al.,
          <article-title>How do fairness definitions fare? testing public attitudes towards three algorithmic definitions of fairness in loan allocations</article-title>
          ,
          <source>Artif. Intell</source>
          .
          <volume>283</volume>
          (
          <year>2020</year>
          )
          <fpage>103238</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>Verma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Rubin</surname>
          </string-name>
          ,
          <article-title>Fairness definitions explained</article-title>
          ,
          <source>in: Proceedings of the FairWare@ICSE</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>7</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>P.</given-names>
            <surname>Saleiro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Kuester</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Stevens</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Anisfeld</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Hinkson</surname>
          </string-name>
          , J. London,
          <string-name>
            <given-names>R.</given-names>
            <surname>Ghani</surname>
          </string-name>
          ,
          <article-title>Aequitas: A Bias and Fairness Audit Toolkit</article-title>
          , CoRR abs/
          <year>1811</year>
          .05577 (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>L.</given-names>
            <surname>Baresi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Criscuolo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Ghezzi</surname>
          </string-name>
          ,
          <article-title>Understanding fairness requirements for ml-based software</article-title>
          , in: IEEE RE, IEEE,
          <year>2023</year>
          , pp.
          <fpage>341</fpage>
          -
          <lpage>346</lpage>
          . doi:
          <volume>10</volume>
          .1109/RE57278.
          <year>2023</year>
          .
          <volume>00046</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>C.</given-names>
            <surname>Criscuolo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Dolci</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Salnitri</surname>
          </string-name>
          ,
          <article-title>Towards assessing data bias in clinical trials, in: Heterogeneous Data Management, Polystores, and Analytics for Healthcare -</article-title>
          VLDB Workshops,
          <source>Poly 2022 and DMAH 2022</source>
          , Springer,
          <year>2022</year>
          , pp.
          <fpage>57</fpage>
          -
          <lpage>74</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>031</fpage>
          -23905-2\ _5.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>B.</given-names>
            <surname>d'Alessandro</surname>
          </string-name>
          ,
          <string-name>
            <surname>C. O'Neil</surname>
            ,
            <given-names>T. LaGatta</given-names>
          </string-name>
          ,
          <article-title>Conscientious classification: A data scientist's guide to discrimination-aware classification</article-title>
          ,
          <source>Big data 5</source>
          (
          <year>2017</year>
          )
          <fpage>120</fpage>
          -
          <lpage>134</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>S.</given-names>
            <surname>Caton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Haas</surname>
          </string-name>
          ,
          <article-title>Fairness in machine learning: A survey</article-title>
          ,
          <source>ACM Comput. Surv</source>
          . (
          <year>2023</year>
          ). doi:
          <volume>10</volume>
          .1145/3616865, just accepted.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>N.</given-names>
            <surname>Mehrabi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Morstatter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Saxena</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lerman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Galstyan</surname>
          </string-name>
          ,
          <article-title>A survey on bias and fairness in machine learning</article-title>
          ,
          <source>ACM Comput. Surv</source>
          .
          <volume>54</volume>
          (
          <year>2022</year>
          )
          <volume>115</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>115</lpage>
          :
          <fpage>35</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>D.</given-names>
            <surname>Pessach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Shmueli</surname>
          </string-name>
          ,
          <article-title>A review on fairness in machine learning</article-title>
          ,
          <source>ACM Comput. Surv</source>
          .
          <volume>55</volume>
          (
          <year>2022</year>
          ). doi:
          <volume>10</volume>
          .1145/3494672.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>A.</given-names>
            <surname>Balayn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Lofi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.-J.</given-names>
            <surname>Houben</surname>
          </string-name>
          ,
          <article-title>Managing bias and unfairness in data for decision support: a survey of machine learning and data engineering approaches to identify and mitigate bias and unfairness within data management and analytics systems</article-title>
          ,
          <source>The VLDB Journal</source>
          <volume>30</volume>
          (
          <year>2021</year>
          )
          <fpage>739</fpage>
          -
          <lpage>768</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>K.</given-names>
            <surname>Orphanou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Otterbacher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kleanthous</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Batsuren</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Giunchiglia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Bogina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. S.</given-names>
            <surname>Tal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Hartman</surname>
          </string-name>
          , T. Kuflik,
          <article-title>Mitigating bias in algorithmic systems-a fish-eye view</article-title>
          ,
          <source>ACM Comput. Surv</source>
          .
          <volume>55</volume>
          (
          <year>2022</year>
          ). doi:
          <volume>10</volume>
          .1145/3527152.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>S. A.</given-names>
            <surname>Friedler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Scheidegger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Venkatasubramanian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Choudhary</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. P.</given-names>
            <surname>Hamilton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Roth</surname>
          </string-name>
          ,
          <article-title>A comparative study of fairness-enhancing interventions in machine learning</article-title>
          ,
          <source>in: Proceedings of FAT, FAT* '19</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          ,
          <year>2019</year>
          , p.
          <fpage>329</fpage>
          -
          <lpage>338</lpage>
          . doi:
          <volume>10</volume>
          .1145/3287560.3287589.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>F.</given-names>
            <surname>Kamiran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Calders</surname>
          </string-name>
          ,
          <article-title>Data preprocessing techniques for classification without discrimination</article-title>
          ,
          <source>Knowledge and Information Systems</source>
          <volume>33</volume>
          (
          <year>2012</year>
          )
          <fpage>1</fpage>
          -
          <lpage>33</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>M.</given-names>
            <surname>Feldman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. A.</given-names>
            <surname>Friedler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Moeller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Scheidegger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Venkatasubramanian</surname>
          </string-name>
          ,
          <article-title>Certifying and removing disparate impact</article-title>
          ,
          <source>in: proceedings of the ACM SIGKDD</source>
          ,
          <year>2015</year>
          , pp.
          <fpage>259</fpage>
          -
          <lpage>268</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>R.</given-names>
            <surname>Zemel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Swersky</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Pitassi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Dwork</surname>
          </string-name>
          ,
          <article-title>Learning fair representations</article-title>
          ,
          <source>in: ICML, PMLR</source>
          ,
          <year>2013</year>
          , pp.
          <fpage>325</fpage>
          -
          <lpage>333</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>F.</given-names>
            <surname>Calmon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Vinzamuri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Natesan Ramamurthy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. R.</given-names>
            <surname>Varshney</surname>
          </string-name>
          ,
          <article-title>Optimized pre-processing for discrimination prevention</article-title>
          ,
          <source>NeurIPS</source>
          <volume>30</volume>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>S.</given-names>
            <surname>Bird</surname>
          </string-name>
          , et al.,
          <article-title>Fairlearn: A toolkit for assessing and improving fairness in ai</article-title>
          , Microsoft,
          <source>Tech. Rep. MSR-TR-2020-32</source>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>B. H.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Lemoine</surname>
          </string-name>
          , M. Mitchell,
          <article-title>Mitigating unwanted biases with adversarial learning</article-title>
          ,
          <source>in: Proceedings of the AAAI/ACM</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>335</fpage>
          -
          <lpage>340</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>T.</given-names>
            <surname>Kamishima</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Akaho</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Asoh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Sakuma</surname>
          </string-name>
          ,
          <article-title>Fairness-aware classifier with prejudice remover regularizer</article-title>
          ,
          <source>in: ECML PKDD. Part II 23</source>
          , Springer,
          <year>2012</year>
          , pp.
          <fpage>35</fpage>
          -
          <lpage>50</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>A.</given-names>
            <surname>Agarwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Beygelzimer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dudík</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Langford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wallach</surname>
          </string-name>
          ,
          <article-title>A reductions approach to fair classification</article-title>
          , in: ICML, PMLR,
          <year>2018</year>
          , pp.
          <fpage>60</fpage>
          -
          <lpage>69</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>G.</given-names>
            <surname>Pleiss</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Raghavan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kleinberg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. Q.</given-names>
            <surname>Weinberger</surname>
          </string-name>
          ,
          <article-title>On fairness and calibration</article-title>
          ,
          <source>NeurIPS</source>
          <volume>30</volume>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>F.</given-names>
            <surname>Kamiran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Karim</surname>
          </string-name>
          ,
          <string-name>
            <surname>X. Zhang,</surname>
          </string-name>
          <article-title>Decision theory for discrimination-aware classification</article-title>
          , in: IEEE IICDM, IEEE,
          <year>2012</year>
          , pp.
          <fpage>924</fpage>
          -
          <lpage>929</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>