{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T17:15:22Z","timestamp":1772039722872,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:00:00Z","timestamp":1587340800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,4,20]]},"DOI":"10.1145\/3366424.3383534","type":"proceedings-article","created":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T08:10:56Z","timestamp":1588579856000},"page":"172-175","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["FairSearch: A Tool For Fairness in Ranked Search Results"],"prefix":"10.1145","author":[{"given":"Meike","family":"Zehlike","sequence":"first","affiliation":[{"name":"Humboldt Universit\u00e4t zu Berlin Max Planck Inst. for Software Systems"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom","family":"S\u00fchr","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Berlin"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Castillo","sequence":"additional","affiliation":[{"name":"Universitat Pompeu Fabra"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Kitanovski","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science and Engineering University Saint Cyril and Methodius"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,4,20]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2018. Resumes Dataset with Labels. https:\/\/www.kaggle.com\/iammhaseeb\/resumes-dataset-with-labels Accessed: 2018-11-02.  2018. Resumes Dataset with Labels. https:\/\/www.kaggle.com\/iammhaseeb\/resumes-dataset-with-labels Accessed: 2018-11-02."},{"key":"e_1_3_2_1_2_1","volume-title":"Discrimination and Privacy in the Information Society","author":"Calders Toon","unstructured":"Toon Calders and Indr\u0117 \u017dliobait\u0117 . 2013. Why unbiased computational processes can lead to discriminative decision procedures . In Discrimination and Privacy in the Information Society . Springer , 43\u201357. Toon Calders and Indr\u0117 \u017dliobait\u0117. 2013. Why unbiased computational processes can lead to discriminative decision procedures. In Discrimination and Privacy in the Information Society. Springer, 43\u201357."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_1_4_1","volume-title":"Proc","author":"Dwork Cynthia","unstructured":"Cynthia Dwork , Moritz Hardt , Toniann Pitassi , Omer Reingold , and Richard Zemel . 2012. Fairness through awareness . In Proc . of ITCS. ACM Press , 214\u2013226. Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, and Richard Zemel. 2012. Fairness through awareness. In Proc. of ITCS. ACM Press, 214\u2013226."},{"key":"e_1_3_2_1_5_1","unstructured":"Moritz Hardt. 2014. How big data is unfair: Understanding sources of unfairness in data driven decision making.  Moritz Hardt. 2014. How big data is unfair: Understanding sources of unfairness in data driven decision making."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/275537.275701"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220088"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2460276.2460278"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132938"},{"key":"e_1_3_2_1_10_1","unstructured":"Meike Zehlike and Carlos Castillo. 2018. Reducing disparate exposure in ranking: A learning to rank approach. arXiv preprint arXiv:1805.08716(2018).  Meike Zehlike and Carlos Castillo. 2018. Reducing disparate exposure in ranking: A learning to rank approach. arXiv preprint arXiv:1805.08716(2018)."},{"key":"e_1_3_2_1_11_1","unstructured":"Meike Zehlike and Tom S\u00fchr. 2019. FA*IR in FairSearch \u2013 Tutorial. Youtube. https:\/\/youtu.be\/UXxTijlb5SY  Meike Zehlike and Tom S\u00fchr. 2019. FA*IR in FairSearch \u2013 Tutorial. Youtube. https:\/\/youtu.be\/UXxTijlb5SY"}],"event":{"name":"WWW '20: The Web Conference 2020","location":"Taipei Taiwan","acronym":"WWW '20","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Companion Proceedings of the Web Conference 2020"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3366424.3383534","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3366424.3383534","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:33:06Z","timestamp":1750199586000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3366424.3383534"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,20]]},"references-count":11,"alternative-id":["10.1145\/3366424.3383534","10.1145\/3366424"],"URL":"https:\/\/doi.org\/10.1145\/3366424.3383534","relation":{},"subject":[],"published":{"date-parts":[[2020,4,20]]},"assertion":[{"value":"2020-04-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}