{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:05:43Z","timestamp":1740099943698,"version":"3.37.3"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["IIS-1633724, CCF-2008688"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,3,3]]},"DOI":"10.1145\/3442188.3445913","type":"proceedings-article","created":{"date-parts":[[2021,2,25]],"date-time":"2021-02-25T01:45:48Z","timestamp":1614217548000},"page":"504-514","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["Fair Clustering via Equitable Group Representations"],"prefix":"10.1145","author":[{"given":"Mohsen","family":"Abbasi","sequence":"first","affiliation":[{"name":"University of Utah"}]},{"given":"Aditya","family":"Bhaskara","sequence":"additional","affiliation":[{"name":"University of Utah"}]},{"given":"Suresh","family":"Venkatasubramanian","sequence":"additional","affiliation":[{"name":"University of Utah"}]}],"member":"320","published-online":{"date-parts":[[2021,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975673.90"},{"key":"e_1_3_2_1_2_1","volume-title":"Fairness in clustering with multiple sensitive attributes. arXiv preprint arXiv:1910.05113","author":"Abraham S. S.","year":"2019","unstructured":"S. S. Abraham , S. S. Sundaram , Fairness in clustering with multiple sensitive attributes. arXiv preprint arXiv:1910.05113 , 2019 . S. S. Abraham, S. S. Sundaram, et al. Fairness in clustering with multiple sensitive attributes. arXiv preprint arXiv:1910.05113, 2019."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330987"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/151002320"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/s0097539702416402"},{"key":"e_1_3_2_1_6_1","volume-title":"Scalable fair clustering. arXiv preprint arXiv:1902.03519","author":"Backurs A.","year":"2019","unstructured":"A. Backurs , P. Indyk , K. Onak , B. Schieber , A. Vakilian , and T. Wagner . Scalable fair clustering. arXiv preprint arXiv:1902.03519 , 2019 . A. Backurs, P. Indyk, K. Onak, B. Schieber, A. Vakilian, and T. Wagner. Scalable fair clustering. arXiv preprint arXiv:1902.03519, 2019."},{"key":"e_1_3_2_1_7_1","first-page":"4955","volume-title":"Advances in Neural Information Processing Systems","author":"Bera S.","year":"2019","unstructured":"S. Bera , D. Chakrabarty , N. Flores , and M. Negahbani . Fair algorithms for clustering . In Advances in Neural Information Processing Systems , pages 4955 -- 4966 , 2019 . S. Bera, D. Chakrabarty, N. Flores, and M. Negahbani. Fair algorithms for clustering. In Advances in Neural Information Processing Systems, pages 4955--4966, 2019."},{"key":"e_1_3_2_1_8_1","volume-title":"Fair algorithms for clustering. arXiv preprint arXiv:1901.02393","author":"Bera S. K.","year":"2019","unstructured":"S. K. Bera , D. Chakrabarty , and M. Negahbani . Fair algorithms for clustering. arXiv preprint arXiv:1901.02393 , 2019 . S. K. Bera, D. Chakrabarty, and M. Negahbani. Fair algorithms for clustering. arXiv preprint arXiv:1901.02393, 2019."},{"key":"e_1_3_2_1_9_1","volume-title":"On the cost of essentially fair clusterings. arXiv preprint arXiv:1811.10319","author":"Bercea I. O.","year":"2018","unstructured":"I. O. Bercea , M. Gro\u00df , S. Khuller , A. Kumar , C. R\u00f6sner , D. R. Schmidt , and M. Schmidt . On the cost of essentially fair clusterings. arXiv preprint arXiv:1811.10319 , 2018 . I. O. Bercea, M. Gro\u00df, S. Khuller, A. Kumar, C. R\u00f6sner, D. R. Schmidt, and M. Schmidt. On the cost of essentially fair clusterings. arXiv preprint arXiv:1811.10319, 2018."},{"key":"e_1_3_2_1_10_1","first-page":"4349","volume-title":"Advances in neural information processing systems","author":"Bolukbasi T.","year":"2016","unstructured":"T. Bolukbasi , K.-W. Chang , J. Y. Zou , V. Saligrama , and A. T. Kalai . Man is to computer programmer as woman is to homemaker? debiasing word embeddings . In Advances in neural information processing systems , pages 4349 -- 4357 , 2016 . T. Bolukbasi, K.-W. Chang, J. Y. Zou, V. Saligrama, and A. T. Kalai. Man is to computer programmer as woman is to homemaker? debiasing word embeddings. In Advances in neural information processing systems, pages 4349--4357, 2016."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2002.1882"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31594-7_17"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.3386\/w26487"},{"key":"e_1_3_2_1_14_1","volume-title":"Proportionally fair clustering. arXiv preprint arXiv:1905.03674","author":"Chen X.","year":"2019","unstructured":"X. Chen , B. Fain , C. Lyu , and K. Munagala . Proportionally fair clustering. arXiv preprint arXiv:1905.03674 , 2019 . X. Chen, B. Fain, C. Lyu, and K. Munagala. Proportionally fair clustering. arXiv preprint arXiv:1905.03674, 2019."},{"key":"e_1_3_2_1_15_1","first-page":"5029","volume-title":"Proc. NIPS","author":"Chierichetti F.","year":"2017","unstructured":"F. Chierichetti , R. Kumar , S. Lattanzi , and S. Vassilvitskii . Fair clustering through fairlets . In Proc. NIPS , pages 5029 -- 5037 , 2017 . F. Chierichetti, R. Kumar, S. Lattanzi, and S. Vassilvitskii. Fair clustering through fairlets. In Proc. NIPS, pages 5029--5037, 2017."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1089\/big.2016.0047"},{"key":"e_1_3_2_1_17_1","volume-title":"The uncapicitated facility location problem. Technical report","author":"Cornu\u00e9jols G.","year":"1983","unstructured":"G. Cornu\u00e9jols , G. Nemhauser , and L. Wolsey . The uncapicitated facility location problem. Technical report , Cornell University Operations Research and Industrial Engineering , 1983 . G. Cornu\u00e9jols, G. Nemhauser, and L. Wolsey. The uncapicitated facility location problem. Technical report, Cornell University Operations Research and Industrial Engineering, 1983."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090255"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783311"},{"key":"e_1_3_2_1_20_1","volume-title":"Fair k-means clustering. arXiv preprint arXiv:2006.10085","author":"Ghadiri M.","year":"2020","unstructured":"M. Ghadiri , S. Samadi , and S. Vempala . Fair k-means clustering. arXiv preprint arXiv:2006.10085 , 2020 . M. Ghadiri, S. Samadi, and S. Vempala. Fair k-means clustering. arXiv preprint arXiv:2006.10085, 2020."},{"key":"e_1_3_2_1_21_1","volume-title":"Simpler analyses of local search algorithms for facility location. CoRR, abs\/0809.2554","author":"Gupta A.","year":"2008","unstructured":"A. Gupta and K. Tangwongsan . Simpler analyses of local search algorithms for facility location. CoRR, abs\/0809.2554 , 2008 . A. Gupta and K. Tangwongsan. Simpler analyses of local search algorithms for facility location. CoRR, abs\/0809.2554, 2008."},{"key":"e_1_3_2_1_22_1","first-page":"3315","volume-title":"Proc. NIPS","author":"Hardt M.","year":"2016","unstructured":"M. Hardt , E. Price , N. Srebro , Equality of opportunity in supervised learning . In Proc. NIPS , pages 3315 -- 3323 , 2016 . M. Hardt, E. Price, N. Srebro, et al. Equality of opportunity in supervised learning. In Proc. NIPS, pages 3315--3323, 2016."},{"key":"e_1_3_2_1_23_1","first-page":"7587","volume-title":"Advances in Neural Information Processing Systems","author":"Huang L.","year":"2019","unstructured":"L. Huang , S. Jiang , and N. Vishnoi . Coresets for clustering with fairness constraints . In Advances in Neural Information Processing Systems , pages 7587 -- 7598 , 2019 . L. Huang, S. Jiang, and N. Vishnoi. Coresets for clustering with fairness constraints. In Advances in Neural Information Processing Systems, pages 7587--7598, 2019."},{"key":"e_1_3_2_1_24_1","volume-title":"Clustering with fairness constraints: A flexible and scalable approach","author":"Jing I. M. Z. E. G.","year":"2019","unstructured":"I. M. Z. E. G. Jing and Y. I. B. Ayed . Clustering with fairness constraints: A flexible and scalable approach . 2019 . I. M. Z. E. G. Jing and Y. I. B. Ayed. Clustering with fairness constraints: A flexible and scalable approach. 2019."},{"key":"e_1_3_2_1_25_1","volume-title":"A center in your neighborhood: Fairness in facility location. arXiv preprint arXiv:1908.09041","author":"Jung C.","year":"2019","unstructured":"C. Jung , S. Kannan , and N. Lutz . A center in your neighborhood: Fairness in facility location. arXiv preprint arXiv:1908.09041 , 2019 . C. Jung, S. Kannan, and N. Lutz. A center in your neighborhood: Fairness in facility location. arXiv preprint arXiv:1908.09041, 2019."},{"key":"e_1_3_2_1_26_1","volume-title":"Inherent trade-offs in the fair determination of risk scores. arXiv preprint arXiv:1609.05807","author":"Kleinberg J.","year":"2016","unstructured":"J. Kleinberg , S. Mullainathan , and M. Raghavan . Inherent trade-offs in the fair determination of risk scores. arXiv preprint arXiv:1609.05807 , 2016 . J. Kleinberg, S. Mullainathan, and M. Raghavan. Inherent trade-offs in the fair determination of risk scores. arXiv preprint arXiv:1609.05807, 2016."},{"key":"e_1_3_2_1_27_1","volume-title":"Fair k-center clustering for data summarization. arXiv preprint arXiv:1901.08628","author":"Kleindessner M.","year":"2019","unstructured":"M. Kleindessner , P. Awasthi , and J. Morgenstern . Fair k-center clustering for data summarization. arXiv preprint arXiv:1901.08628 , 2019 . M. Kleindessner, P. Awasthi, and J. Morgenstern. Fair k-center clustering for data summarization. arXiv preprint arXiv:1901.08628, 2019."},{"key":"e_1_3_2_1_28_1","volume-title":"Guarantees for spectral clustering with fairness constraints. arXiv preprint arXiv:1901.08668","author":"Kleindessner M.","year":"2019","unstructured":"M. Kleindessner , S. Samadi , P. Awasthi , and J. Morgenstern . Guarantees for spectral clustering with fairness constraints. arXiv preprint arXiv:1901.08668 , 2019 . M. Kleindessner, S. Samadi, P. Awasthi, and J. Morgenstern. Guarantees for spectral clustering with fairness constraints. arXiv preprint arXiv:1901.08668, 2019."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2012.01.007"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488723"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/130938645"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90208-D"},{"key":"e_1_3_2_1_33_1","volume-title":"(individual) fairness for k-clustering. arXiv preprint arXiv:2002.06742","author":"Mahabadi S.","year":"2020","unstructured":"S. Mahabadi and A. Vakilian . (individual) fairness for k-clustering. arXiv preprint arXiv:2002.06742 , 2020 . S. Mahabadi and A. Vakilian. (individual) fairness for k-clustering. arXiv preprint arXiv:2002.06742, 2020."},{"key":"e_1_3_2_1_34_1","volume-title":"Prediction-based decisions and fairness: A catalogue of choices, assumptions, and definitions","author":"Mitchell S.","year":"2018","unstructured":"S. Mitchell , E. Potash , S. Barocas , A. D'Amour , and K. Lum . Prediction-based decisions and fairness: A catalogue of choices, assumptions, and definitions , 2018 . S. Mitchell, E. Potash, S. Barocas, A. D'Amour, and K. Lum. Prediction-based decisions and fairness: A catalogue of choices, assumptions, and definitions, 2018."},{"key":"e_1_3_2_1_35_1","volume-title":"ACM Conference on Fairness, Accountability and Transparency","author":"Narayanan A.","year":"2019","unstructured":"A. Narayanan . 21 definitions of fairness and their politics. Tutorial , ACM Conference on Fairness, Accountability and Transparency , 2019 . A. Narayanan. 21 definitions of fairness and their politics. Tutorial, ACM Conference on Fairness, Accountability and Transparency, 2019."},{"key":"e_1_3_2_1_36_1","first-page":"1","volume-title":"The Knowledge Engineering Review","author":"Romei A.","year":"2013","unstructured":"A. Romei and S. Ruggieri . A multidisciplinary survey on discrimination analysis . The Knowledge Engineering Review , pages 1 -- 57 , April 3 2013 . A. Romei and S. Ruggieri. A multidisciplinary survey on discrimination analysis. The Knowledge Engineering Review, pages 1--57, April 3 2013."},{"key":"e_1_3_2_1_37_1","volume-title":"Privacy preserving clustering with constraints. arXiv preprint arXiv:1802.02497","author":"R\u00f6sner C.","year":"2018","unstructured":"C. R\u00f6sner and M. Schmidt . Privacy preserving clustering with constraints. arXiv preprint arXiv:1802.02497 , 2018 . C. R\u00f6sner and M. Schmidt. Privacy preserving clustering with constraints. arXiv preprint arXiv:1802.02497, 2018."},{"key":"e_1_3_2_1_38_1","first-page":"10999","volume-title":"Proc. NeurIPS","author":"Samadi S.","year":"2018","unstructured":"S. Samadi , U. Tantipongpipat , J. H. Morgenstern , M. Singh , and S. Vempala . The Price of Fair PCA: One Extra dimension . In Proc. NeurIPS , pages 10999 -- 11010 , 2018 . S. Samadi, U. Tantipongpipat, J. H. Morgenstern, M. Singh, and S. Vempala. The Price of Fair PCA: One Extra dimension. In Proc. NeurIPS, pages 10999--11010, 2018."},{"key":"e_1_3_2_1_39_1","volume-title":"Fair coresets and streaming algorithms for fair k-means clustering. arXiv preprint arXiv:1812.10854","author":"Schmidt M.","year":"2018","unstructured":"M. Schmidt , C. Schwiegelshohn , and C. Sohler . Fair coresets and streaming algorithms for fair k-means clustering. arXiv preprint arXiv:1812.10854 , 2018 . M. Schmidt, C. Schwiegelshohn, and C. Sohler. Fair coresets and streaming algorithms for fair k-means clustering. arXiv preprint arXiv:1812.10854, 2018."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258600"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2014.01.015"},{"key":"e_1_3_2_1_42_1","volume-title":"Towards fair deep clustering with multi-state protected variables. arXiv preprint arXiv:1901.10053","author":"Wang B.","year":"2019","unstructured":"B. Wang and I. Davidson . Towards fair deep clustering with multi-state protected variables. arXiv preprint arXiv:1901.10053 , 2019 . B. Wang and I. Davidson. Towards fair deep clustering with multi-state protected variables. arXiv preprint arXiv:1901.10053, 2019."}],"event":{"name":"FAccT '21: 2021 ACM Conference on Fairness, Accountability, and Transparency","sponsor":["ACM Association for Computing Machinery"],"location":"Virtual Event Canada","acronym":"FAccT '21"},"container-title":["Proceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3442188.3445913","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3442188.3445913","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T19:29:29Z","timestamp":1675366169000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3442188.3445913"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3]]},"references-count":42,"alternative-id":["10.1145\/3442188.3445913","10.1145\/3442188"],"URL":"https:\/\/doi.org\/10.1145\/3442188.3445913","relation":{},"subject":[],"published":{"date-parts":[[2021,3]]},"assertion":[{"value":"2021-03-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}