default search action
Meike Zehlike
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j4]Meike Zehlike
, Ke Yang
Fairness in Ranking, Part II: Learning-to-Rank and Recommender Systems. ACM Comput. Surv. 55(6): 117:1-117:41 (2023) - [j3]Meike Zehlike
Fairness in Ranking, Part I: Score-Based Ranking. ACM Comput. Surv. 55(6): 118:1-118:36 (2023) - [c8]Alex Loosley, Amrollah Seifoddini, Alessandro Canopoli, Meike Zehlike:
Body Measurement Prediction Fairness. EWAF 2023 - [c7]Julia Stoyanovich
Fairness in Ranking: From Values to Technical Choices and Back. SIGMOD Conference Companion 2023: 7-12 - [c6]Valeria Fionda
Tutorials at The Web Conference 2023. WWW (Companion Volume) 2023: 648-658 - [e1]José M. Álvarez, Alessandro Fabris, Christoph Heitz, Corinna Hertweck, Michele Loi, Meike Zehlike:
Proceedings of the 2nd European Workshop on Algorithmic Fairness, Winterthur, Switzerland, June 7th to 9th, 2023. CEUR Workshop Proceedings 3442, CEUR-WS.org 2023 [contents] - 2022
- [b1]Meike Zehlike:
Fairness in Rankings. Humboldt University of Berlin, Germany, 2022 - [j2]Meike Zehlike, Tom Sühr
Fair Top-k Ranking with multiple protected groups. Inf. Process. Manag. 59(1): 102707 (2022) - [c5]Gourab K. Patro, Lorenzo Porcaro
Fair ranking: a critical review, challenges, and future directions. FAccT 2022: 1929-1942 - [p1]Meike Zehlike:
Fairness in Rankings. Ausgezeichnete Informatikdissertationen 2022: 311-320 - [i8]Gourab K. Patro, Lorenzo Porcaro, Laura Mitchell, Qiuyue Zhang, Meike Zehlike, Nikhil Garg:
Fair ranking: a critical review, challenges, and future directions. CoRR abs/2201.12662 (2022) - [i7]Meike Zehlike, Alex Loosley, Håkan Jonsson, Emil Wiedemann, Philipp Hacker:
Beyond Incompatibility: Trade-offs between Mutually Exclusive Fairness Criteria in Machine Learning and Law. CoRR abs/2212.00469 (2022) - 2021
- [i6]Meike Zehlike, Ke Yang, Julia Stoyanovich:
Fairness in Ranking: A Survey. CoRR abs/2103.14000 (2021) - 2020
- [j1]Meike Zehlike, Philipp Hacker, Emil Wiedemann:
Matching code and law: achieving algorithmic fairness with optimal transport. Data Min. Knowl. Discov. 34(1): 163-200 (2020) - [c4]Meike Zehlike, Tom Sühr, Carlos Castillo, Ivan Kitanovski:
FairSearch: A Tool For Fairness in Ranked Search Results. WWW (Companion Volume) 2020: 172-175 - [c3]Meike Zehlike, Carlos Castillo:
Reducing Disparate Exposure in Ranking: A Learning To Rank Approach. WWW 2020: 2849-2855 - [i5]Philipp Hacker, Emil Wiedemann, Meike Zehlike:
Towards a Flexible Framework for Algorithmic Fairness. CoRR abs/2010.07848 (2020) - [i4]Meike Zehlike, Tom Sühr, Carlos Castillo:
A Note on the Significance Adjustment for FA*IR with Two Protected Groups. CoRR abs/2012.12795 (2020)
2010 – 2019
- 2019
- [c2]Tom Sühr, Asia J. Biega, Meike Zehlike, Krishna P. Gummadi
Two-Sided Fairness for Repeated Matchings in Two-Sided Markets: A Case Study of a Ride-Hailing Platform. KDD 2019: 3082-3092 - [i3]Meike Zehlike, Tom Sühr, Carlos Castillo, Ivan Kitanovski:
FairSearch: A Tool For Fairness in Ranked Search Results. CoRR abs/1905.13134 (2019) - 2018
- [i2]Meike Zehlike, Carlos Castillo:
Reducing Disparate Exposure in Ranking: A Learning To Rank Approach. CoRR abs/1805.08716 (2018) - 2017
- [c1]Meike Zehlike, Francesco Bonchi, Carlos Castillo
FA*IR: A Fair Top-k Ranking Algorithm. CIKM 2017: 1569-1578 - [i1]Meike Zehlike, Francesco Bonchi, Carlos Castillo, Sara Hajian, Mohamed Megahed, Ricardo Baeza-Yates:
FA*IR: A Fair Top-k Ranking Algorithm. CoRR abs/1706.06368 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: