{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T04:38:15Z","timestamp":1682483895566},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,4,25]]},"DOI":"10.1145\/3485447.3512188","type":"proceedings-article","created":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T05:13:07Z","timestamp":1650863587000},"update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Fair k-Center Clustering in MapReduce and Streaming Settings"],"prefix":"10.1145","author":[{"given":"Suman K.","family":"Bera","sequence":"first","affiliation":[{"name":"Katana Graph, USA"}]},{"given":"Syamantak","family":"Das","sequence":"additional","affiliation":[{"name":"IIIT Delhi, India"}]},{"given":"Sainyam","family":"Galhotra","sequence":"additional","affiliation":[{"name":"University of Chicago, USA"}]},{"given":"Sagar Sudhir","family":"Kale","sequence":"additional","affiliation":[{"name":"University of Vienna, Austria"}]}],"member":"320","published-online":{"date-parts":[[2022,4,25]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"[n.d.]. Google + dataset SNAP http:\/\/snap.stanford.edu\/data\/ego-Gplus.html. [n.d.]. Google + dataset SNAP http:\/\/snap.stanford.edu\/data\/ego-Gplus.html."},{"key":"e_1_3_2_1_2_1","volume-title":"SNAP","unstructured":"[n.d.]. Pokec dataset , SNAP , http:\/\/snap.stanford.edu\/data\/soc-Pokec.html. [n.d.]. Pokec dataset, SNAP, http:\/\/snap.stanford.edu\/data\/soc-Pokec.html."},{"key":"e_1_3_2_1_3_1","unstructured":"Saba Ahmadi Sainyam Galhotra Barna Saha and Roy Schwartz. 2020. Fair Correlation Clustering. CoRR abs\/2002.03508(2020). arXiv:2002.03508https:\/\/arxiv.org\/abs\/2002.03508 Saba Ahmadi Sainyam Galhotra Barna Saha and Roy Schwartz. 2020. Fair Correlation Clustering. CoRR abs\/2002.03508(2020). arXiv:2002.03508https:\/\/arxiv.org\/abs\/2002.03508"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330987"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3125644"},{"key":"e_1_3_2_1_6_1","volume-title":"Conference on Neural Information Processing Systems. 4955\u20134966","author":"Bera Suman","year":"2019","unstructured":"Suman Bera , Deeparnab Chakrabarty , Nicolas Flores , and Maryam Negahbani . 2019 . Fair algorithms for clustering . In Conference on Neural Information Processing Systems. 4955\u20134966 . Suman Bera, Deeparnab Chakrabarty, Nicolas Flores, and Maryam Negahbani. 2019. Fair algorithms for clustering. In Conference on Neural Information Processing Systems. 4955\u20134966."},{"key":"e_1_3_2_1_7_1","volume-title":"International Workshop on Approximation Algorithms for Combinatorial Optimization Problems.","author":"Bercea O.","year":"2019","unstructured":"Ioana\u00a0 O. Bercea , Martin Gro\u00df , Samir Khuller , Aounon Kumar , Clemens R\u00f6sner , Daniel\u00a0 R. Schmidt , and Melanie Schmidt . 2019 . On the cost of essentially fair clusterings . In International Workshop on Approximation Algorithms for Combinatorial Optimization Problems. Ioana\u00a0O. Bercea, Martin Gro\u00df, Samir Khuller, Aounon Kumar, Clemens R\u00f6sner, Daniel\u00a0R. Schmidt, and Melanie Schmidt. 2019. On the cost of essentially fair clusterings. In International Workshop on Approximation Algorithms for Combinatorial Optimization Problems."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/3317315.3317319"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.73"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1057\/dbm.2012.17"},{"key":"e_1_3_2_1_11_1","volume-title":"Proc. 31st Conference on Neural Information Processing Systems. 5029\u20135037","author":"Chierichetti Flavio","year":"2017","unstructured":"Flavio Chierichetti , Ravi Kumar , Silvio Lattanzi , and Sergei Vassilvitskii . 2017 . Fair clustering through fairlets . In Proc. 31st Conference on Neural Information Processing Systems. 5029\u20135037 . Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, and Sergei Vassilvitskii. 2017. Fair clustering through fairlets. In Proc. 31st Conference on Neural Information Processing Systems. 5029\u20135037."},{"key":"e_1_3_2_1_12_1","volume-title":"MapReduce: Simplified Data Processing on Large Clusters. In 6th Symposium on Operating System Design and Implementation (OSDI 2004","author":"Dean Jeffrey","year":"2004","unstructured":"Jeffrey Dean and Sanjay Ghemawat . 2004 . MapReduce: Simplified Data Processing on Large Clusters. In 6th Symposium on Operating System Design and Implementation (OSDI 2004 ), San Francisco, California, USA , December 6-8, 2004. 137\u2013150. Jeffrey Dean and Sanjay Ghemawat. 2004. MapReduce: Simplified Data Processing on Large Clusters. In 6th Symposium on Operating System Design and Implementation (OSDI 2004), San Francisco, California, USA, December 6-8, 2004. 137\u2013150."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020515"},{"key":"e_1_3_2_1_14_1","unstructured":"Sainyam Galhotra. 2021. Robust Algorithms for Clustering with Applications to Data Integration. (2021). Sainyam Galhotra. 2021. Robust Algorithms for Clustering with Applications to Data Integration. (2021)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90224-5"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2663716.2663744"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2998181.2998327"},{"key":"e_1_3_2_1_18_1","volume-title":"KFC: A Scalable Approximation Algorithm for k-center Fair Clustering. In Advances in Neural Information Processing Systems. 14509\u201314519.","author":"Harb Elfarouk","year":"2020","unstructured":"Elfarouk Harb and Ho\u00a0Shan Lam . 2020 . KFC: A Scalable Approximation Algorithm for k-center Fair Clustering. In Advances in Neural Information Processing Systems. 14509\u201314519. Elfarouk Harb and Ho\u00a0Shan Lam. 2020. KFC: A Scalable Approximation Algorithm for k-center Fair Clustering. In Advances in Neural Information Processing Systems. 14509\u201314519."},{"key":"e_1_3_2_1_19_1","volume-title":"Proc. 33rd Conference on Neural Information Processing Systems. 7587\u20137598","author":"Huang Lingxiao","year":"2019","unstructured":"Lingxiao Huang , Shaofeng Jiang , and Nisheeth Vishnoi . 2019 . Coresets for clustering with fairness constraints . In Proc. 33rd Conference on Neural Information Processing Systems. 7587\u20137598 . Lingxiao Huang, Shaofeng Jiang, and Nisheeth Vishnoi. 2019. Coresets for clustering with fairness constraints. In Proc. 33rd Conference on Neural Information Processing Systems. 7587\u20137598."},{"key":"e_1_3_2_1_20_1","unstructured":"IBM. 2019. IBM ILOG CPLEX 12.9. (2019). IBM. 2019. IBM ILOG CPLEX 12.9. (2019)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755607"},{"key":"e_1_3_2_1_22_1","first-page":"230","article-title":"Feature extraction using fuzzy c-means clustering for data mining systems","volume":"6","author":"Venugopal Srinivasa KG, K","year":"2006","unstructured":"Srinivasa KG, K Venugopal , and L Patnaik . 2006 . Feature extraction using fuzzy c-means clustering for data mining systems . IJCSNS 6 , 3A (2006), 230 . Srinivasa KG, K Venugopal, and L Patnaik. 2006. Feature extraction using fuzzy c-means clustering for data mining systems. IJCSNS 6, 3A (2006), 230.","journal-title":"IJCSNS"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312186"},{"key":"e_1_3_2_1_24_1","first-page":"1063","article-title":"Fast distributed k-center clustering with outliers on massive data","volume":"28","author":"Malkomes Gustavo","year":"2015","unstructured":"Gustavo Malkomes , Matt\u00a0 J Kusner , Wenlin Chen , Kilian\u00a0 Q Weinberger , and Benjamin Moseley . 2015 . Fast distributed k-center clustering with outliers on massive data . Advances in Neural Information Processing Systems 28 (2015), 1063 \u2013 1071 . Gustavo Malkomes, Matt\u00a0J Kusner, Wenlin Chen, Kilian\u00a0Q Weinberger, and Benjamin Moseley. 2015. Fast distributed k-center clustering with outliers on massive data. Advances in Neural Information Processing Systems 28 (2015), 1063\u20131071.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_25_1","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"McCutchen Richard\u00a0Matthew","unstructured":"Richard\u00a0Matthew McCutchen and Samir Khuller . 2008. Streaming algorithms for k-center clustering with outliers and with anonymity . In Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques . Springer , 165\u2013178. Richard\u00a0Matthew McCutchen and Samir Khuller. 2008. Streaming algorithms for k-center clustering with outliers and with anonymity. In Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques. Springer, 165\u2013178."},{"key":"e_1_3_2_1_26_1","first-page":"1","article-title":"Privacy Preserving Clustering with Constraints. In Proc. 45th International Colloquium on Automata","volume":"96","author":"R\u00f6sner Clemens","year":"2018","unstructured":"Clemens R\u00f6sner and Melanie Schmidt . 2018 . Privacy Preserving Clustering with Constraints. In Proc. 45th International Colloquium on Automata , Languages and Programming. 96 : 1 \u2013 96 :14. Clemens R\u00f6sner and Melanie Schmidt. 2018. Privacy Preserving Clustering with Constraints. In Proc. 45th International Colloquium on Automata, Languages and Programming. 96:1\u201396:14.","journal-title":"Languages and Programming."},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the fifth international conference on computer and information technology, Vol.\u00a01. 291\u2013324","author":"Sarwar M","year":"2002","unstructured":"Badrul\u00a0 M Sarwar , George Karypis , Joseph Konstan , and John Riedl . 2002 . Recommender systems for large-scale e-commerce: Scalable neighborhood formation using clustering . In Proceedings of the fifth international conference on computer and information technology, Vol.\u00a01. 291\u2013324 . Badrul\u00a0M Sarwar, George Karypis, Joseph Konstan, and John Riedl. 2002. Recommender systems for large-scale e-commerce: Scalable neighborhood formation using clustering. In Proceedings of the fifth international conference on computer and information technology, Vol.\u00a01. 291\u2013324."},{"key":"e_1_3_2_1_28_1","volume-title":"An approximation algorithm for the generalized assignment problem. Mathematical programming 62, 1-3","author":"Shmoys B.","year":"1993","unstructured":"David\u00a0 B. Shmoys and \u00c9va Tardos . 1993. An approximation algorithm for the generalized assignment problem. Mathematical programming 62, 1-3 ( 1993 ), 461\u2013474. David\u00a0B. Shmoys and \u00c9va Tardos. 1993. An approximation algorithm for the generalized assignment problem. Mathematical programming 62, 1-3 (1993), 461\u2013474."},{"key":"e_1_3_2_1_29_1","volume-title":"Potential for Discrimination in Online Targeted Advertising. In Conference on Fairness, Accountability and Transparency. 5\u201319","author":"Speicher Till","year":"2018","unstructured":"Till Speicher , Muhammad Ali , Giridhari Venkatadri , Filipe\u00a0Nunes Ribeiro , George Arvanitakis , Fabr\u00edcio Benevenuto , Krishna\u00a0 P Gummadi , Patrick Loiseau , and Alan Mislove . 2018 . Potential for Discrimination in Online Targeted Advertising. In Conference on Fairness, Accountability and Transparency. 5\u201319 . Till Speicher, Muhammad Ali, Giridhari Venkatadri, Filipe\u00a0Nunes Ribeiro, George Arvanitakis, Fabr\u00edcio Benevenuto, Krishna\u00a0P Gummadi, Patrick Loiseau, and Alan Mislove. 2018. Potential for Discrimination in Online Targeted Advertising. In Conference on Fairness, Accountability and Transparency. 5\u201319."}],"event":{"name":"WWW '22: The ACM Web Conference 2022","location":"Virtual Event, Lyon France","acronym":"WWW '22","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2022"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3485447.3512188","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T13:24:57Z","timestamp":1682429097000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485447.3512188"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,25]]},"references-count":29,"alternative-id":["10.1145\/3485447.3512188","10.1145\/3485447"],"URL":"http:\/\/dx.doi.org\/10.1145\/3485447.3512188","relation":{},"published":{"date-parts":[[2022,4,25]]},"assertion":[{"value":"2022-04-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}