{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,6]],"date-time":"2023-07-06T17:40:36Z","timestamp":1688665236964},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T00:00:00Z","timestamp":1671235200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T00:00:00Z","timestamp":1671235200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["IIS-1908530","IIS-1910306"],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s10618-022-00893-6","type":"journal-article","created":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T13:07:22Z","timestamp":1671282442000},"page":"1404-1440","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Making clusterings fairer by post-processing: algorithms, complexity results and experiments"],"prefix":"10.1007","volume":"37","author":[{"given":"Ian","family":"Davidson","sequence":"first","affiliation":[]},{"given":"Zilong","family":"Bai","sequence":"additional","affiliation":[]},{"given":"Cindy Mylinh","family":"Tran","sequence":"additional","affiliation":[]},{"given":"S. S.","family":"Ravi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,17]]},"reference":[{"key":"893_CR1","doi-asserted-by":"crossref","unstructured":"Abbasi M, Bhaskara A, Venkatasubramanian S (2021) Fair clustering via equitable group representations. In: Proceedings of FAccT, p\u00a011","DOI":"10.1145\/3442188.3445913"},{"key":"893_CR2","unstructured":"Ahmadi S, Galhotra S, Saha B, Schwartz R (2020) Fair correlation clustering. CoRR https:\/\/arxiv.org\/abs\/2002.03508"},{"key":"893_CR3","unstructured":"Ahmadian S, Epasto A, Kumar R, Mahdian M (2020) Fair correlation clustering. In: The 23rd international conference on artificial intelligence and statistics, AISTATS 2020, 26\u201328 August 2020, Online [Palermo, Sicily, Italy], pp 4195\u20134205"},{"key":"893_CR4","unstructured":"Backurs A, Indyk P, Onak K, Schieber B, Vakilian A, Wagner, T (2019) Scalable fair clustering. In: Proceedings of 36th ICML, pp 405\u2013413"},{"key":"893_CR5","unstructured":"Ballotpedia: Ballotpedia. (2020). Retrieved 2 September 2020, from (2020). https:\/\/ballotpedia.org\/Redistricting_in_California"},{"key":"893_CR6","first-page":"671","volume":"671","author":"S Barocas","year":"2016","unstructured":"Barocas S, Selbst AD (2016) Big data\u2019s disparate impact. California Law Rev 671:671\u2013732","journal-title":"California Law Rev"},{"key":"893_CR7","unstructured":"Barocas S, Hardt M, Narayanan A (2017) Fairness in machine learning. NeurIPS tutorial"},{"key":"893_CR8","doi-asserted-by":"publisher","DOI":"10.1201\/9781584889977","volume-title":"Constrained clustering: advances in algorithms, theory and applications","author":"S Basu","year":"2008","unstructured":"Basu S, Davidson I, Wagstaff K (2008) Constrained clustering: advances in algorithms, theory and applications. CRC Press, Cambridge"},{"key":"893_CR9","unstructured":"Bera SK, Chakrabarty D, Negahbani M (2019) Fair algorithms for clustering. ArXiv preprint arXiv:1901.02393"},{"key":"893_CR10","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF01584535","volume":"2","author":"C Berge","year":"1972","unstructured":"Berge C (1972) Balanced matrices. Math Program 2:19\u201331","journal-title":"Math Program"},{"key":"893_CR11","unstructured":"Bureau C (2020a) Bureau, Census. American Community Survey (ACS). Retrieved 2 September 2020, from (2020). https:\/\/www.census.gov\/programs-surveys\/acs"},{"key":"893_CR12","unstructured":"Bureau C (2020b) Bureau, Census. ZIP Code Tabulation Areas (ZCTAs). Retrieved 2 September 2020, from (2020). https:\/\/www.census.gov\/programs-surveys\/geography\/guidance\/geo-areas\/zctas.html"},{"key":"893_CR13","unstructured":"Chen X, Fain B, Lyu L, Munagala K (2019) Proportionally fair clustering. In: Proceedings of the 36th international conference on machine learning, ICML 2019, 9\u201315 June 2019, Long Beach, California, USA, Proceedings of Machine Learning Research, pp 1032\u20131041"},{"key":"893_CR14","unstructured":"Chhabra A, Mohapatra P (2020) Fair algorithms for hierarchical agglomerative clustering. CoRR https:\/\/arxiv.org\/abs\/2005.03197"},{"key":"893_CR15","doi-asserted-by":"publisher","first-page":"130698","DOI":"10.1109\/ACCESS.2021.3114099","volume":"9","author":"A Chhabra","year":"2021","unstructured":"Chhabra A, Masalkovaite K, Mohapatra P (2021) An overview of fairness in clustering. IEEE Access 9:130698\u2013130720","journal-title":"IEEE Access"},{"key":"893_CR16","unstructured":"Chierichetti F, Kumar R, Lattanzi S, Vassilvitskii S (2017) Fair clustering through fairlets. In: Proceedings of NeurIPS, pp 5036\u20135044"},{"key":"893_CR17","unstructured":"CNMP: Center for New Media & Promotion (CNMP), U (2020) My Congressional District. Retrieved 2 September 2020, from (2020). https:\/\/www.census.gov\/mycd\/?st=06"},{"key":"893_CR18","unstructured":"Commission UEEO (2007) Employment tests and selection procedures. Retrieved 2 September 2020, from. https:\/\/www.ncsl.org\/research\/redistricting\/election-dates-for-legislators-governors-who-will-do-redistricting.aspx"},{"key":"893_CR19","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms, 2nd edn. MIT Press and McGraw-Hill, Cambridge","edition":"2"},{"issue":"1","key":"893_CR20","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10618-006-0053-7","volume":"14","author":"I Davidson","year":"2007","unstructured":"Davidson I, Ravi SS (2007) The complexity of non-hierarchical clustering with instance and cluster level constraints. Data Min Knowl Discov 14(1):25\u201361","journal-title":"Data Min Knowl Discov"},{"key":"893_CR21","doi-asserted-by":"crossref","unstructured":"Davidson I, Ravi SS (2020) Making existing clusterings fairer: algorithms, complexity results and insights. In: The thirty-fourth AAAI conference on artificial intelligence. AAAI New York, NY, USA. AAAI Press, pp 3733\u20133740","DOI":"10.1609\/aaai.v34i04.5783"},{"key":"893_CR22","unstructured":"Dua D, Graff C (2017) UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml"},{"key":"893_CR23","doi-asserted-by":"crossref","unstructured":"Dwork C, Hardt M, Pitassi T, Reingold O, Zemel RS (2012) Fairness through awareness. In: Innovations in theoretical computer science 2012, Cambridge, MA, USA, January 8\u201310, 2012, pp 214\u2013226","DOI":"10.1145\/2090236.2090255"},{"key":"893_CR24","doi-asserted-by":"crossref","unstructured":"Feldman M, Friedler SA, Moeller J, Scheidegger C, Venkatasubramanian S (2015) Certifying and removing disparate impact. In: Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining, Sydney, NSW, Australia, August 10\u201313, 2015, pp 259\u2013268","DOI":"10.1145\/2783258.2783311"},{"key":"893_CR25","unstructured":"Flores NJ (2019) Fair algorithms for clustering. Dartmouth Computer Science Technical Report TR2019-867"},{"key":"893_CR26","unstructured":"Friedler SA, Scheidegger C, Venkatasubramanian S (2016) On the (im)possibility of fairness. CoRR http:\/\/arxiv.org\/abs\/1609.07236"},{"key":"893_CR27","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman & Co., San Francisco"},{"key":"893_CR28","unstructured":"Gurobi optimizer reference manual. Available from https:\/\/www.gurobi.com\/documentation\/9.1\/refman\/index.html (2020)"},{"key":"893_CR29","unstructured":"Kleindessner M, Awasthi P, Morgenstern J (2019) Fair $$k$$-center clustering for data summarization. In: Proceedings of ICML, pp 3448\u20133457"},{"key":"893_CR30","unstructured":"Kleindessner M, Samadi S, Awasthi P, Morgenstern J (2019) Guarantees for spectral clustering with fairness constraints. In: Proceedings of ICML, pp 3458\u20133467"},{"key":"893_CR31","doi-asserted-by":"crossref","unstructured":"Kuo CT, Ravi SS, Dao TBH, Vrain C, Davidson I (2017) A framework for minimal clustering modification via constraint programming. In: AAAI, pp 1389\u20131395","DOI":"10.1609\/aaai.v31i1.10765"},{"key":"893_CR32","unstructured":"Mahabadi S, Vakilian A (2020) Individual fairness for $$k$$-clustering. In: Proceedings of the 37th international conference on machine learning, ICML 2020, 13\u201318 July 2020, Virtual Event, pp 6586\u20136596"},{"key":"893_CR33","unstructured":"NCSL: NCSL (2019) Election Dates for Legislators and Governors Who Will Do Redistricting. Retrieved 2 September 2020, from (2019). https:\/\/www.ncsl.org\/research\/redistricting\/election-dates-for-legislators-governors-who-will-do-redistricting.aspx"},{"key":"893_CR34","unstructured":"R\u00f6sner C, Schmidt M (2018) Privacy preserving clustering with constraints. ArXiv preprint arXiv:1802.02497"},{"key":"893_CR35","doi-asserted-by":"crossref","unstructured":"Schaffer C (1994) A conservation law for generalization performance. In: Proceedings of ICML, pp 259\u2013265. Elsevier, New York","DOI":"10.1016\/B978-1-55860-335-6.50039-8"},{"key":"893_CR36","volume-title":"Theory of linear and integer programming","author":"A Schrijver","year":"1998","unstructured":"Schrijver A (1998) Theory of linear and integer programming. Wiley, New York"},{"key":"893_CR37","unstructured":"Thanh BL, Ruggieri S, Turini F (2011) $$k$$-NN as an implementation of situation testing for discrimination discovery and prevention. In: Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining, San Diego, CA, USA, August 21\u201324, 2011, pp 502\u2013510"},{"key":"893_CR38","doi-asserted-by":"crossref","unstructured":"Vaidya PM (1989) Speeding-up linear programming using fast matrix multiplication (extended abstract). In: 30th annual symposium on foundations of computer science, Research Triangle Park, North Carolina, USA, 30 October\u20131 November 1989, pp 332\u2013337","DOI":"10.1109\/SFCS.1989.63499"},{"key":"893_CR39","unstructured":"von Luxburg U (2006) A Tutorial on spectral clustering. Tech. Rep. TR-149, Max Planck Institute for Biological Cybernetics, Germany"},{"key":"893_CR40","volume-title":"Approximation algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani VV (2001) Approximation algorithms. Springer, New York"},{"key":"893_CR41","unstructured":"Wagstaff K, Cardie C (2000) Clustering with instance-level constraints. In: Proceedings of the seventeenth national conference on artificial intelligence and twelfth conference on on innovative applications of artificial intelligence, July 30\u2013August 3, 2000, Austin, Texas, USA, pp 1097\u20131192"},{"issue":"1","key":"893_CR42","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evolut Comput 1(1):67\u201382","journal-title":"IEEE Trans Evolut Comput"},{"issue":"3","key":"893_CR43","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1109\/TNN.2005.845141","volume":"16","author":"R Xu","year":"2005","unstructured":"Xu R, Wunsch DC (2005) Survey of clustering algorithms. IEEE Trans Neural Netw 16(3):645\u2013678","journal-title":"IEEE Trans Neural Netw"},{"key":"893_CR44","doi-asserted-by":"crossref","unstructured":"Ziko IM, Yuan J, Granger E, Ayed IB (2021) Variational fair clustering. In: Proceedings of thirty-fifth conference on artificial intelligence (AAAI). AAAI Press, pp 11202\u201311209","DOI":"10.1609\/aaai.v35i12.17336"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-022-00893-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-022-00893-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-022-00893-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,6]],"date-time":"2023-07-06T17:15:31Z","timestamp":1688663731000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-022-00893-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,17]]},"references-count":44,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["893"],"URL":"https:\/\/doi.org\/10.1007\/s10618-022-00893-6","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,17]]},"assertion":[{"value":"15 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}