FA*IR: a fair top-k ranking algorithm

Mostra el registre complet Registre parcial de l'ítem

• dc.contributor.author Zehlike, Meike
• dc.contributor.author Bonchi, Francesco
• dc.contributor.author Castillo, Carlos
• dc.contributor.author Hajian, Sara
• dc.contributor.author Megahed, Mohamed
• dc.contributor.author Baeza Yates, Ricardo
• dc.date.accessioned 2019-03-20T17:37:26Z
• dc.date.available 2019-03-20T17:37:26Z
• dc.date.issued 2017
• dc.description Comunicació presentada a: CIKM '17 Conference on Information and Knowledge Management, celebrada del 6 al 10 de novembre de 2017 a Singapur, Singapur.ca
• dc.description.abstract In this work, we define and solve the Fair Top-k Ranking problem, in which we want to determine a subset of k candidates from a large pool of n>>k candidates, maximizing utility (i.e., select the “best” candidates) subject to group fairness criteria. Our ranked group fairness de nition extends group fairness using the standard notion of protected groups and is based on ensuring that the proportion of protected candidates in every pre x of the top-k ranking remains statistically above or indistinguishable from a given minimum. Utility is operationalized in two ways: (i) every candidate included in the top-k should be more quali ed than every candidate not included; and (ii) for every pair of candidates in the top-k, the more qualified candidate should be ranked above. An efficient algorithm is presented for producing the Fair Top-k Ranking, and tested experimentally on existing datasets as well as new datasets released with this paper, showing that our approach yields small distortions with respect to rankings that maximize utility without considering fairness criteria. To the best of our knowledge, this is the first algorithm grounded in statistical tests that can mitigate biases in the representation of an under-represented group along a ranked list.en
• dc.description.sponsorship This research was supported by the German Research Foundation, Eurecat and the Catalonia Trade and Investment Agency (ACCIÓ). M.Z. and M.M. were supported by the GRF. C.C. and S.H. worked on this paper while at Eurecat. C.C., S.H., and F.B. were supported by ACCIÓ.en
• dc.format.mimetype application/pdf
• dc.identifier.citation Zehlike M, Bonchi F, Castillo C, Hajian S, Megahed M, Baeza-Yates R. FA*IR: a fair top-k ranking algorithm. In: CIKM '17 Proceedings of the 2017 ACM on Conference on Information and Knowledge Management; 2017 Nov 6-10; Singapore, Singapore. New York: ACM; 2017. p. 1569-78. DOI: 10.1145/3132847.3132938
• dc.identifier.doi http://dx.doi.org/10.1145/3132847.3132938
• dc.identifier.isbn 978-1-4503-4918-5
• dc.identifier.uri http://hdl.handle.net/10230/36874
• dc.language.iso eng
• dc.publisher ACM Association for Computer Machinery
• dc.relation.ispartof CIKM '17 Proceedings of the 2017 ACM on Conference on Information and Knowledge Management; 2017 Nov 6-10; Singapore, Singapore. New York: ACM; 2017. p. 1569-78.
• dc.rights © ACM, 2017. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in CIKM '17 Proceedings of the 2017 ACM on Conference on Information and Knowledge Management http://doi.acm.org/10.1145/3132847.3132938
• dc.rights.accessRights info:eu-repo/semantics/openAccess
• dc.subject.keyword Algorithmic fairnessen
• dc.subject.keyword Bias in computer systemsen
• dc.subject.keyword Rankingen
• dc.subject.keyword Top-k selectionen
• dc.title FA*IR: a fair top-k ranking algorithm
• dc.type info:eu-repo/semantics/conferenceObject
• dc.type.version info:eu-repo/semantics/acceptedVersion