FairSearch: A Tool for Fairness in Ranked Search Results

13Citations
Citations of this article
41Readers
Mendeley users who have this article in their library.

Abstract

Ranked search results and recommendations have become the main mechanism by which we find content, products, places, and people online. With hiring, selecting, purchasing, and dating being increasingly mediated by algorithms, rankings may determine business opportunities, education, access to benefits, and even social success. It is therefore of societal and ethical importance to ask whether search results can demote, marginalize, or exclude individuals of unprivileged groups or promote products with undesired features. In this paper we present FairSearch, the first fair open source search API to provide fairness notions in ranked search results. We implement two well-known algorithms from the literature, namely FA∗IR (Zehlike et al., 9) and DELTR (Zehlike and Castillo, 10) and provide them as stand-alone libraries in Python and Java. Additionally we implement interfaces to Elasticsearch for both algorithms, a well-known search engine API based on Apache Lucene. The interfaces use the aforementioned Java libraries and enable search engine developers who wish to ensure fair search results of different styles to easily integrate DELTR and FA∗IR into their existing Elasticsearch environment.

Cite

CITATION STYLE

APA

Zehlike, M., Sühr, T., Castillo, C., & Kitanovski, I. (2020). FairSearch: A Tool for Fairness in Ranked Search Results. In The Web Conference 2020 - Companion of the World Wide Web Conference, WWW 2020 (pp. 172–175). Association for Computing Machinery. https://doi.org/10.1145/3366424.3383534

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free