{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:09:37Z","timestamp":1775066977088,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T00:00:00Z","timestamp":1593993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,6]]},"DOI":"10.1145\/3394231.3397910","type":"proceedings-article","created":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T20:24:04Z","timestamp":1592943844000},"page":"202-211","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Representativity Fairness in Clustering"],"prefix":"10.1145","author":[{"given":"Deepak","family":"P","sequence":"first","affiliation":[{"name":"Queen's University Belfast, UK and Indian Institute of Technology Madras, India"}]},{"given":"Savitha Sam","family":"Abraham","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Madras, India"}]}],"member":"320","published-online":{"date-parts":[[2020,7,6]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Savitha Abraham P Deepak and Sowmya Sundaram. 2020. Fairness in Clustering with Multiple Sensitive Attributes. In EDBT.  Savitha Abraham P Deepak and Sowmya Sundaram. 2020. Fairness in Clustering with Multiple Sensitive Attributes. In EDBT."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Sara Ahmadian Alessandro Epasto Ravi Kumar and Mohammad Mahdian. 2019. Clustering without over-representation. In SIGKDD. 267\u2013275.  Sara Ahmadian Alessandro Epasto Ravi Kumar and Mohammad Mahdian. 2019. Clustering without over-representation. In SIGKDD. 267\u2013275.","DOI":"10.1145\/3292500.3330987"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5840\/philtopics2004321\/217"},{"key":"e_1_3_2_2_4_1","unstructured":"Suman Bera Deeparnab Chakrabarty Nicolas Flores and Maryam Negahbani. 2019. Fair algorithms for clustering. In Advances in Neural Information Processing Systems. 4955\u20134966.  Suman Bera Deeparnab Chakrabarty Nicolas Flores and Maryam Negahbani. 2019. Fair algorithms for clustering. In Advances in Neural Information Processing Systems. 4955\u20134966."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Reuben Binns. 2020. On the apparent conflict between individual and group fairness. In FAT*. 514\u2013524.  Reuben Binns. 2020. On the apparent conflict between individual and group fairness. In FAT*. 514\u2013524.","DOI":"10.1145\/3351095.3372864"},{"key":"e_1_3_2_2_6_1","unstructured":"Xingyu Chen Brandon Fain Charles Lyu and Kamesh Munagala. 2019. Proportionally Fair Clustering. In ICML.  Xingyu Chen Brandon Fain Charles Lyu and Kamesh Munagala. 2019. Proportionally Fair Clustering. In ICML."},{"key":"e_1_3_2_2_7_1","unstructured":"Flavio Chierichetti Ravi Kumar Silvio Lattanzi and Sergei Vassilvitskii. 2017. Fair clustering through fairlets. In NIPS. 5029\u20135037.  Flavio Chierichetti Ravi Kumar Silvio Lattanzi and Sergei Vassilvitskii. 2017. Fair clustering through fairlets. In NIPS. 5029\u20135037."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1977.tb01600.x"},{"key":"e_1_3_2_2_9_1","unstructured":"Dheeru Dua and Casey Graff. 2019. UCI Machine Learning Repository. http:\/\/archive.ics.uci.edu\/ml  Dheeru Dua and Casey Graff. 2019. UCI Machine Learning Repository. http:\/\/archive.ics.uci.edu\/ml"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090255"},{"key":"e_1_3_2_2_11_1","volume-title":"Stable and Fair Classification. arXiv:1902.07823","author":"Huang Lingxiao","year":"2019","unstructured":"Lingxiao Huang and Nisheeth\u00a0 K Vishnoi . 2019. Stable and Fair Classification. arXiv:1902.07823 ( 2019 ). Lingxiao Huang and Nisheeth\u00a0K Vishnoi. 2019. Stable and Fair Classification. arXiv:1902.07823 (2019)."},{"key":"e_1_3_2_2_12_1","unstructured":"Anil\u00a0K Jain Richard\u00a0C Dubes 1988. Algorithms for clustering data. Vol.\u00a06. Prentice hall Englewood Cliffs NJ.  Anil\u00a0K Jain Richard\u00a0C Dubes 1988. Algorithms for clustering data. Vol.\u00a06. Prentice hall Englewood Cliffs NJ."},{"key":"e_1_3_2_2_13_1","volume-title":"A quantitative measure of fairness and discrimination. Eastern Research Laboratory","author":"Jain K","year":"1984","unstructured":"Rajendra\u00a0 K Jain , Dah-Ming\u00a0 W Chiu , and William\u00a0 R Hawe . 1984. A quantitative measure of fairness and discrimination. Eastern Research Laboratory , Digital Equipment Corporation , Hudson, MA ( 1984 ). Rajendra\u00a0K Jain, Dah-Ming\u00a0W Chiu, and William\u00a0R Hawe. 1984. A quantitative measure of fairness and discrimination. Eastern Research Laboratory, Digital Equipment Corporation, Hudson, MA (1984)."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"Rawls John. 1971. A theory of justice. (1971).  Rawls John. 1971. A theory of justice. (1971).","DOI":"10.4159\/9780674042605"},{"key":"e_1_3_2_2_15_1","volume-title":"Inherent trade-offs in the fair determination of risk scores. arXiv:1609.05807","author":"Kleinberg Jon","year":"2016","unstructured":"Jon Kleinberg , Sendhil Mullainathan , and Manish Raghavan . 2016. Inherent trade-offs in the fair determination of risk scores. arXiv:1609.05807 ( 2016 ). Jon Kleinberg, Sendhil Mullainathan, and Manish Raghavan. 2016. Inherent trade-offs in the fair determination of risk scores. arXiv:1609.05807 (2016)."},{"key":"e_1_3_2_2_16_1","volume-title":"Fair k-center clustering for data summarization. arXiv:1901.08628","author":"Kleindessner Matth\u00e4us","year":"2019","unstructured":"Matth\u00e4us Kleindessner , Pranjal Awasthi , and Jamie Morgenstern . 2019. Fair k-center clustering for data summarization. arXiv:1901.08628 ( 2019 ). Matth\u00e4us Kleindessner, Pranjal Awasthi, and Jamie Morgenstern. 2019. Fair k-center clustering for data summarization. arXiv:1901.08628 (2019)."},{"key":"e_1_3_2_2_17_1","volume-title":"Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, Vol.\u00a01","author":"MacQueen James","year":"1967","unstructured":"James MacQueen 1967 . Some methods for classification and analysis of multivariate observations . In Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, Vol.\u00a01 . Oakland, CA, USA, 281\u2013297. James MacQueen 1967. Some methods for classification and analysis of multivariate observations. In Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, Vol.\u00a01. Oakland, CA, USA, 281\u2013297."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.3301663"},{"key":"e_1_3_2_2_19_1","volume-title":"Incremental Fairness in Two-Sided Market Platforms: On Updating Recommendations Fairly. arXiv:1909.10005","author":"Patro K","year":"2019","unstructured":"Gourab\u00a0 K Patro , Abhijnan Chakraborty , Niloy Ganguly , and Krishna\u00a0 P Gummadi . 2019. Incremental Fairness in Two-Sided Market Platforms: On Updating Recommendations Fairly. arXiv:1909.10005 ( 2019 ). Gourab\u00a0K Patro, Abhijnan Chakraborty, Niloy Ganguly, and Krishna\u00a0P Gummadi. 2019. Incremental Fairness in Two-Sided Market Platforms: On Updating Recommendations Fairly. arXiv:1909.10005 (2019)."},{"key":"e_1_3_2_2_20_1","unstructured":"Leonard KAUFMAN Peter\u00a0J RDUSSEEUN. 1987. Clustering by means of medoids. (1987).  Leonard KAUFMAN Peter\u00a0J RDUSSEEUN. 1987. Clustering by means of medoids. (1987)."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(87)90125-7"},{"key":"e_1_3_2_2_22_1","volume-title":"The idea of justice","author":"Sen Amartya\u00a0Kumar","unstructured":"Amartya\u00a0Kumar Sen . 2009. The idea of justice . Harvard University Press . Amartya\u00a0Kumar Sen. 2009. The idea of justice. Harvard University Press."},{"key":"e_1_3_2_2_23_1","first-page":"28","article-title":"Rawlsian Justice: Disjunction Between Choice And Observance","volume":"50","author":"Sharma TR","year":"1989","unstructured":"TR Sharma . 1989 . Rawlsian Justice: Disjunction Between Choice And Observance . The Indian Journal of Political Science 50 , 1 (1989), 28 \u2013 48 . TR Sharma. 1989. Rawlsian Justice: Disjunction Between Choice And Observance. The Indian Journal of Political Science 50, 1 (1989), 28\u201348.","journal-title":"The Indian Journal of Political Science"},{"key":"e_1_3_2_2_24_1","unstructured":"Andrea Vattani. 2009. The hardness of k-means clustering in the plane. Manuscript accessible at http:\/\/cseweb. ucsd. edu\/avattani\/papers\/kmeans_hardness. pdf 617(2009).  Andrea Vattani. 2009. The hardness of k-means clustering in the plane. Manuscript accessible at http:\/\/cseweb. ucsd. edu\/avattani\/papers\/kmeans_hardness. pdf 617(2009)."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-016-9477-7"},{"key":"e_1_3_2_2_26_1","volume-title":"Fairness Constraints: Mechanisms for Fair Classification. In Artificial Intelligence and Statistics. 962\u2013970.","author":"Zafar Muhammad\u00a0Bilal","year":"2017","unstructured":"Muhammad\u00a0Bilal Zafar , Isabel Valera , Manuel\u00a0Gomez Rogriguez , and Krishna\u00a0 P Gummadi . 2017 . Fairness Constraints: Mechanisms for Fair Classification. In Artificial Intelligence and Statistics. 962\u2013970. Muhammad\u00a0Bilal Zafar, Isabel Valera, Manuel\u00a0Gomez Rogriguez, and Krishna\u00a0P Gummadi. 2017. Fairness Constraints: Mechanisms for Fair Classification. In Artificial Intelligence and Statistics. 962\u2013970."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132938"},{"key":"e_1_3_2_2_28_1","volume-title":"Clustering with Fairness Constraints: A Flexible and Scalable Approach. arXiv:1906.08207","author":"Ziko Imtiaz\u00a0Masud","year":"2019","unstructured":"Imtiaz\u00a0Masud Ziko , Eric Granger , Jing Yuan , and Ismail\u00a0Ben Ayed . 2019. Clustering with Fairness Constraints: A Flexible and Scalable Approach. arXiv:1906.08207 ( 2019 ). Imtiaz\u00a0Masud Ziko, Eric Granger, Jing Yuan, and Ismail\u00a0Ben Ayed. 2019. Clustering with Fairness Constraints: A Flexible and Scalable Approach. arXiv:1906.08207 (2019)."}],"event":{"name":"WebSci '20: 12th ACM Conference on Web Science","location":"Southampton United Kingdom","acronym":"WebSci '20","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["12th ACM Conference on Web Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394231.3397910","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3394231.3397910","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:41Z","timestamp":1750197701000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394231.3397910"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,6]]},"references-count":28,"alternative-id":["10.1145\/3394231.3397910","10.1145\/3394231"],"URL":"https:\/\/doi.org\/10.1145\/3394231.3397910","relation":{},"subject":[],"published":{"date-parts":[[2020,7,6]]},"assertion":[{"value":"2020-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}