{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T06:35:03Z","timestamp":1767854103804,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,25]],"date-time":"2019-07-25T00:00:00Z","timestamp":1564012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,25]]},"DOI":"10.1145\/3292500.3330987","type":"proceedings-article","created":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T13:17:26Z","timestamp":1564147046000},"page":"267-275","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":46,"title":["Clustering without Over-Representation"],"prefix":"10.1145","author":[{"given":"Sara","family":"Ahmadian","sequence":"first","affiliation":[{"name":"Google Research, New York, NY, USA"}]},{"given":"Alessandro","family":"Epasto","sequence":"additional","affiliation":[{"name":"Google Research, Google Research, NY, USA"}]},{"given":"Ravi","family":"Kumar","sequence":"additional","affiliation":[{"name":"Google Research, Mountain View, CA, USA"}]},{"given":"Mohammad","family":"Mahdian","sequence":"additional","affiliation":[{"name":"Google Research, New York, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1404506"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-010-0190-x"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"L Elisa Celis Lingxiao Huang and Nisheeth K Vishnoi. 2018a. Multiwinner Voting with Fairness Constraints.. In IJCAI. 144--151.   L Elisa Celis Lingxiao Huang and Nisheeth K Vishnoi. 2018a. Multiwinner Voting with Fairness Constraints.. In IJCAI. 144--151.","DOI":"10.24963\/ijcai.2018\/20"},{"key":"e_1_3_2_1_4_1","volume-title":"Vishnoi","author":"Celis L. Elisa","year":"2018","unstructured":"L. Elisa Celis , Damian Straszak , and Nisheeth K . Vishnoi . 2018 b. Ranking with Fairness Constraints . (2018), 28:1--28:15. L. Elisa Celis, Damian Straszak, and Nisheeth K. Vishnoi. 2018b. Ranking with Fairness Constraints. (2018), 28:1--28:15."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3133104"},{"key":"e_1_3_2_1_6_1","unstructured":"Flavio Chierichetti Ravi Kumar Silvio Lattanzi and Sergei Vassilvitskii. 2017. Fair clustering through fairlets. In NIPS. 5029--5037.   Flavio Chierichetti Ravi Kumar Silvio Lattanzi and Sergei Vassilvitskii. 2017. Fair clustering through fairlets. In NIPS. 5029--5037."},{"key":"e_1_3_2_1_7_1","unstructured":"Dua Dheeru and Efi Karra Taniskidou. 2017. UCI Machine Learning Repository. (2017). http:\/\/archive.ics.uci.edu\/ml  Dua Dheeru and Efi Karra Taniskidou. 2017. UCI Machine Learning Repository. (2017). http:\/\/archive.ics.uci.edu\/ml"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090255"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90008-3"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186042"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783311"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Benjamin Fish Jeremy Kun and \u00c1d\u00e1m D Lelkes. 2016. A confidence-based approach for balancing fairness and accuracy. In SDM. 144--152.  Benjamin Fish Jeremy Kun and \u00c1d\u00e1m D Lelkes. 2016. A confidence-based approach for balancing fairness and accuracy. In SDM. 144--152.","DOI":"10.1137\/1.9781611974348.17"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90224-5"},{"key":"e_1_3_2_1_14_1","unstructured":"Abdulmecit Gungor. 2018. Fifty Victorian Era Novelists Authorship Attribution Data. (2018).  Abdulmecit Gungor. 2018. Fifty Victorian Era Novelists Authorship Attribution Data. (2018)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.10.2.180"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(79)90044-1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.09.011"},{"key":"e_1_3_2_1_18_1","unstructured":"Matthew Joseph Michael Kearns Jamie H Morgenstern and Aaron Roth. 2016. Fairness in learning: Classic and contextual bandits. In NIPS. 325--333.   Matthew Joseph Michael Kearns Jamie H Morgenstern and Aaron Roth. 2016. Fairness in learning: Classic and contextual bandits. In NIPS. 325--333."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Toshihiro Kamishima Shotaro Akaho Hideki Asoh and Jun Sakuma. 2012. Fairness-aware classifier with prejudice remover regularizer. In PKDD. 35--50.  Toshihiro Kamishima Shotaro Akaho Hideki Asoh and Jun Sakuma. 2012. Fairness-aware classifier with prejudice remover regularizer. In PKDD. 35--50.","DOI":"10.1007\/978-3-642-33486-3_3"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2011.83"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212040"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Jian Li Ke Yi and Qin Zhang. 2010. Clustering with Diversity. In ICALP. 188--200.   Jian Li Ke Yi and Qin Zhang. 2010. Clustering with Diversity. In ICALP. 188--200.","DOI":"10.1007\/978-3-642-14165-2_17"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623682"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_1_25_1","volume-title":"Privacy preserving clustering with constraints. arXiv preprint arXiv:1802.02497","author":"R\u00f6sner Clemens","year":"2018","unstructured":"Clemens R\u00f6sner and Melanie Schmidt . 2018. Privacy preserving clustering with constraints. arXiv preprint arXiv:1802.02497 ( 2018 ). Clemens R\u00f6sner and Melanie Schmidt. 2018. Privacy preserving clustering with constraints. arXiv preprint arXiv:1802.02497 (2018)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3085504.3085526"}],"event":{"name":"KDD '19: The 25th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Anchorage AK USA","acronym":"KDD '19","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3330987","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3292500.3330987","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:26:04Z","timestamp":1750206364000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3330987"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,25]]},"references-count":26,"alternative-id":["10.1145\/3292500.3330987","10.1145\/3292500"],"URL":"https:\/\/doi.org\/10.1145\/3292500.3330987","relation":{},"subject":[],"published":{"date-parts":[[2019,7,25]]},"assertion":[{"value":"2019-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}