<!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>A Search Engine for Algorithmic Fairness Datasets</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Alessandro Fabris</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Fabio Giachelle</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alberto Piva</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Gianmaria Silvello</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Gian Antonio Susto</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Max Planck Institute for Security and Privacy</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Padova</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>Algorithmic equity is a key desideratum for systems embedded in a diverse society producing data with embedded patterns of discrimination. This data is leveraged in algorithmic fairness research with the aim of studying the root causes of undesirable discrimination and developing methods to overcome them. Data documentation is central in supporting discoverability and correct use of existing resources. Documentation debt causes suboptimal data usage, with a negative impact on data-driven research and practice. This work introduces a search engine for algorithmic fairness datasets, describing its scope, functionality, and envisioned use cases, calling for inputs and collaboration within the community for the long-term maintenance and exploitation of this resource.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Algorithmic Fairness</kwd>
        <kwd>Fairness Datasets</kwd>
        <kwd>Documentation Debt</kwd>
        <kwd>Information Access</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Algorithmic Fairness is a scholarly field aimed at ensuring equity in algorithmic decision
making [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], with dedicated measures [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ], algorithms [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ], and auditing procedures [
        <xref ref-type="bibr" rid="ref6 ref7">6, 7</xref>
        ].
Many of the key findings in this field have been data-driven [
        <xref ref-type="bibr" rid="ref8 ref9">8, 9</xref>
        ]. Therefore, the quality of
datasets employed in research and practice are central to the validity of experiments and to the
generalization of results in algorithmic fairness. Downstream efects of data issues triggered
by poor practice that undervalues data quality are both common and avoidable [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Noisy,
inaccurate, or otherwise non-representative data inevitably afect the reliability and utility of
ifndings [
        <xref ref-type="bibr" rid="ref11 ref12">11, 12</xref>
        ]. Algorithmic fairness, as a whole, stands to gain from improvements in its
prevalent data practices.
      </p>
      <p>Recent work has shown that algorithmic fairness articles frequently use “of-the-shelf”
datasets [13]. Fabris et al. [14] call into question the suitability of these benchmark datasets in
algorithmic fairness, documenting over 200 alternative datasets that have been employed in the
ifeld. In this work, we develop a search engine that makes the documentation of Fabris et al.
[14] readily available and searchable.1</p>
    </sec>
    <sec id="sec-2">
      <title>2. Key Functionality</title>
    </sec>
    <sec id="sec-3">
      <title>3. Use Cases and Applications</title>
      <p>The WebApp we developed supports research and practice in algorithmic fairness and critical
data studies in several ways. Below are the main use cases we envision.</p>
      <p>1. Enabling task-driven and domain-driven search for principled dataset selection.
Researchers and practitioners with a specific research angle may use our WebApp to find
the most suited datasets for their needs.
2. Supporting multi-dataset studies in identifying relevant resources; for example, studies
of how race and gender are encoded in datasets can use our tool to select datasets with
the sensitive attributes of interest.
3. Directing data audits and critical data studies towards important resources; for example,
datasets used in many research articles are pivotal for the community and deserve deeper
scrutiny.
4. Highlighting under-explored domains or tasks, where new contributions, such as
algorithms and datasets, can have a larger impact.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Discussion and Call for Contributions</title>
      <p>
        Documentation debt causes suboptimal data usage and negatively afects data-driven research
[
        <xref ref-type="bibr" rid="ref10">10, 15</xref>
        ]. Our WebApp aims to empower the algorithmic fairness community, enabling principled
approaches to select datasets for research, development, and critical data studies. Our
longterm goal is to support easily accessible, up-to-date search along relevant axes. Updating and
maintaining this resource with new datasets will certainly be a challenge.
      </p>
      <p>We call on the algorithmic fairness community, the key stakeholders of this work, to
contribute with guidance and collaboration, to help shape and maintain this resource.
[13] B. Laufer, S. Jain, A. F. Cooper, J. Kleinberg, H. Heidari, Four years of facct: A reflexive,
mixed-methods analysis of research contributions, shortcomings, and future prospects,
in: 2022 ACM Conference on Fairness, Accountability, and Transparency, FAccT ’22,
Association for Computing Machinery, New York, NY, USA, 2022, p. 401–426. URL: https:
//doi.org/10.1145/3531146.3533107. doi:10.1145/3531146.3533107.
[14] A. Fabris, S. Messina, G. Silvello, G. A. Susto, Algorithmic fairness datasets: the story so far,</p>
      <p>Data Mining and Knowledge Discovery (2022). doi:10.1007/s10618-022-00854-z.
[15] E. M. Bender, T. Gebru, A. McMillan-Major, S. Shmitchell, On the dangers of stochastic
parrots: Can language models be too big?, FAccT ’21, Association for Computing Machinery,
New York, NY, USA, 2021, p. 610–623. URL: https://doi.org/10.1145/3442188.3445922. doi:10.
1145/3442188.3445922.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>S.</given-names>
            <surname>Barocas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hardt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Narayanan</surname>
          </string-name>
          ,
          <article-title>Fairness and Machine Learning, fairmlbook</article-title>
          .org,
          <year>2019</year>
          . http://www.fairmlbook.org.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Castelnovo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Crupi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Greco</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Regoli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I. G.</given-names>
            <surname>Penco</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. C.</given-names>
            <surname>Cosentini</surname>
          </string-name>
          ,
          <article-title>A clarification of the nuances in the fairness metrics landscape</article-title>
          ,
          <source>Scientific Reports</source>
          <volume>12</volume>
          (
          <year>2022</year>
          )
          <fpage>4209</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Fabris</surname>
          </string-name>
          , G. Silvello,
          <string-name>
            <given-names>G. A.</given-names>
            <surname>Susto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. J.</given-names>
            <surname>Biega</surname>
          </string-name>
          ,
          <article-title>Pairwise fairness in ranking as a dissatisfaction measure</article-title>
          ,
          <source>in: Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining</source>
          , WSDM '23,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2023</year>
          , p.
          <fpage>931</fpage>
          -
          <lpage>939</lpage>
          . URL: https://doi.org/10.1145/3539597.3570459. doi:
          <volume>10</volume>
          .1145/3539597. 3570459.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M.</given-names>
            <surname>Hardt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Price</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Srebro</surname>
          </string-name>
          ,
          <article-title>Equality of opportunity in supervised learning</article-title>
          ,
          <source>in: Proc. of the 29th Annual Conference on Neural Information Processing Systems (NIPS</source>
          <year>2016</year>
          ), Barcelona,
          <string-name>
            <surname>ES</surname>
          </string-name>
          ,
          <year>2016</year>
          , pp.
          <fpage>3323</fpage>
          -
          <lpage>3331</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>S. C.</given-names>
            <surname>Geyik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ambler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Kenthapadi</surname>
          </string-name>
          ,
          <article-title>Fairness-aware ranking in search &amp; recommendation systems with application to linkedin talent search</article-title>
          ,
          <source>in: Proceedings of the 25th acm sigkdd international conference on knowledge discovery &amp; data mining</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>2221</fpage>
          -
          <lpage>2231</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>A.</given-names>
            <surname>Fabris</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mishler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gottardi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Carletti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Daicampi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. A.</given-names>
            <surname>Susto</surname>
          </string-name>
          , G. Silvello,
          <article-title>Algorithmic audit of italian car insurance: Evidence of unfairness in access and pricing</article-title>
          ,
          <source>in: Proceedings of the 2021 AAAI/ACM Conference on AI</source>
          ,
          <string-name>
            <surname>Ethics</surname>
          </string-name>
          , and Society, AIES '21,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2021</year>
          , p.
          <fpage>458</fpage>
          -
          <lpage>468</lpage>
          . URL: https://doi.org/10.1145/3461702.3462569. doi:
          <volume>10</volume>
          .1145/3461702.3462569.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>A.</given-names>
            <surname>Fabris</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Esuli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Moreo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Sebastiani</surname>
          </string-name>
          ,
          <article-title>Measuring fairness under unawareness of sensitive attributes: A quantification-based approach</article-title>
          ,
          <source>Journal of Artificial Intelligence Research</source>
          <volume>76</volume>
          (
          <year>2023</year>
          )
          <fpage>1117</fpage>
          -
          <lpage>1180</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <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 the Conference on Fairness, Accountability, and Transparency</source>
          , FAT* '
          <volume>19</volume>
          ,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2019</year>
          , p.
          <fpage>329</fpage>
          -
          <lpage>338</lpage>
          . URL: https://doi.org/10.1145/3287560.3287589. doi:
          <volume>10</volume>
          .1145/3287560.3287589.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Buolamwini</surname>
          </string-name>
          , T. Gebru,
          <article-title>Gender shades: Intersectional accuracy disparities in commercial gender classification</article-title>
          , in: Conference on fairness,
          <source>accountability and transparency, PMLR</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>77</fpage>
          -
          <lpage>91</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>N.</given-names>
            <surname>Sambasivan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kapania</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Highfill</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Akrong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Paritosh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. M.</given-names>
            <surname>Aroyo</surname>
          </string-name>
          , “
          <article-title>everyone wants to do the model work, not the data work”: Data cascades in high-stakes ai</article-title>
          ,
          <source>in: proceedings of the 2021 CHI Conference on Human Factors in Computing Systems</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>15</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>M. F.</given-names>
            <surname>Kilkenny</surname>
          </string-name>
          ,
          <string-name>
            <surname>K. M. Robinson</surname>
          </string-name>
          ,
          <article-title>Data quality:“garbage in-garbage out”</article-title>
          , volume
          <volume>47</volume>
          ,
          <string-name>
            <given-names>SAGE</given-names>
            <surname>Publications Sage</surname>
          </string-name>
          <string-name>
            <surname>UK</surname>
          </string-name>
          : London, England,
          <year>2018</year>
          , pp.
          <fpage>103</fpage>
          -
          <lpage>105</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>J.</given-names>
            <surname>Hullman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kapoor</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Nanayakkara</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gelman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Narayanan</surname>
          </string-name>
          ,
          <article-title>The worst of both worlds: A comparative analysis of errors in learning from data in psychology and machine learning</article-title>
          ,
          <source>in: Proceedings of the 2022 AAAI/ACM Conference on AI</source>
          ,
          <string-name>
            <surname>Ethics</surname>
          </string-name>
          , and Society, AIES '22,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2022</year>
          , p.
          <fpage>335</fpage>
          -
          <lpage>348</lpage>
          . URL: https://doi.org/10.1145/3514094.3534196. doi:
          <volume>10</volume>
          .1145/3514094.3534196.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>