{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,28]],"date-time":"2026-08-28T07:41:53Z","timestamp":1787902913182,"version":"build-2784847793"},"reference-count":192,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3114099","type":"journal-article","created":{"date-parts":[[2021,9,20]],"date-time":"2021-09-20T16:26:14Z","timestamp":1632155174000},"page":"130698-130720","source":"Crossref","is-referenced-by-count":82,"title":["An Overview of Fairness in Clustering"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8463-3937","authenticated-orcid":false,"given":"Anshuman","family":"Chhabra","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0577-5919","authenticated-orcid":false,"given":"Karina","family":"Masalkovaite","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2768-5308","authenticated-orcid":false,"given":"Prasant","family":"Mohapatra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref170","doi-asserted-by":"publisher","DOI":"10.1126\/sciadv.aao5580"},{"key":"ref172","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2013.04.015"},{"key":"ref171","doi-asserted-by":"publisher","DOI":"10.1109\/CCWC.2018.8301695"},{"key":"ref174","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.23"},{"key":"ref173","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2004.10087"},{"key":"ref176","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-011-9359-y"},{"key":"ref175","doi-asserted-by":"publisher","DOI":"10.1109\/79.543975"},{"key":"ref178","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(87)90125-7"},{"key":"ref177","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1100.0865"},{"key":"ref168","article-title":"A framework for understanding sources of harm throughout the machine learning life cycle","author":"suresh","year":"2019","journal-title":"arXiv 1901 10002"},{"key":"ref169","doi-asserted-by":"publisher","DOI":"10.1109\/ICACCI.2014.6968361"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897527"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-60990-0_18"},{"key":"ref33","first-page":"438","article-title":"Socially fair k-means clustering","author":"ghadiri","year":"2021","journal-title":"Proc ACM Conf Fairness Accountability Transparency"},{"key":"ref32","article-title":"Fair algorithms for hierarchical agglomerative clustering","author":"chhabra","year":"2020","journal-title":"arXiv 2005 03197"},{"key":"ref31","first-page":"1032","article-title":"Proportionally fair clustering","author":"chen","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref30","first-page":"5029","article-title":"Fair clustering through fairlets","author":"chierichetti","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref37","article-title":"Fairness in ranking: A survey","author":"zehlike","year":"2021","journal-title":"arXiv 2103 14000"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.acl-main.485"},{"key":"ref35","article-title":"Bias and debias in recommender system: A survey and future directions","author":"chen","year":"2020","journal-title":"arXiv 2010 03240"},{"key":"ref34","first-page":"6586","article-title":"Individual fairness for k-clustering","author":"mahabadi","year":"2020","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref181","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5770"},{"key":"ref180","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1979.4766909"},{"key":"ref185","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2855437"},{"key":"ref184","first-page":"2837","article-title":"Information theoretic measures for clusterings comparison: Variants, properties, normalization and correction for chance","volume":"11","author":"vinh","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref183","article-title":"Transferability in machine learning: From phenomena to black-box attacks using adversarial samples","author":"papernot","year":"2016","journal-title":"arXiv 1605 07277"},{"key":"ref182","article-title":"A black-box adversarial attack for poisoning clustering","author":"cin\u00e0","year":"2020","journal-title":"arXiv 2009 05474"},{"key":"ref189","doi-asserted-by":"publisher","DOI":"10.1145\/1497577.1497578"},{"key":"ref188","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-08968-2_16"},{"key":"ref187","author":"bellman","year":"2015","journal-title":"Adaptive Control Processes"},{"key":"ref186","doi-asserted-by":"publisher","DOI":"10.1145\/3173574.3173951"},{"key":"ref28","article-title":"Inherent trade-offs in the fair determination of risk scores","author":"kleinberg","year":"2016","journal-title":"arXiv 1609 05807"},{"key":"ref27","article-title":"A convex framework for fair regression","author":"berk","year":"2017","journal-title":"arXiv 1706 02409"},{"key":"ref179","doi-asserted-by":"publisher","DOI":"10.1080\/03610927408827101"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1111\/j.1745-3984.1971.tb00908.x"},{"key":"ref20","article-title":"The measure and mismeasure of fairness: A critical review of fair machine learning","author":"corbett-davies","year":"2018","journal-title":"arXiv 1808 00023"},{"key":"ref22","first-page":"119","article-title":"Decoupled classifiers for group-fair and efficient machine learning","author":"dwork","year":"2018","journal-title":"Proc Conf Fairness Accountability Transparency"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/862"},{"key":"ref24","first-page":"3315","article-title":"Equality of opportunity in supervised learning","volume":"29","author":"hardt","year":"2016","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref23","first-page":"325","article-title":"Learning fair representations","author":"zemel","year":"2013","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref101","article-title":"Deep fair discriminative clustering","author":"zhang","year":"2021","journal-title":"arXiv 2105 14146"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090255"},{"key":"ref100","first-page":"3458","article-title":"Guarantees for spectral clustering with fairness constraints","author":"kleindessner","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052660"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/s40745-015-0040-1"},{"key":"ref51","first-page":"281","article-title":"Some methods for classification and analysis of multivariate observations","volume":"1","author":"macqueen","year":"1967","journal-title":"Proc 5th Berkeley Symp Math Statist Probab"},{"key":"ref154","doi-asserted-by":"publisher","DOI":"10.1023\/A:1015457400897"},{"key":"ref153","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0136497"},{"key":"ref156","year":"2021","journal-title":"P-Median Uncapacitated Dataset"},{"key":"ref155","year":"2021","journal-title":"Kinematics Word Problems"},{"key":"ref150","doi-asserted-by":"publisher","DOI":"10.1080\/03155986.1999.11732388"},{"key":"ref152","first-page":"506","article-title":"A critical comparative study of liver patients from USA and INDIA: An exploratory analysis","volume":"9","author":"ramana","year":"2012","journal-title":"Int J Comput Sci Issues"},{"key":"ref151","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-55723-6_18"},{"key":"ref146","year":"2019","journal-title":"D Ataset 4"},{"key":"ref147","doi-asserted-by":"publisher","DOI":"10.1109\/DISCEX.2000.821515"},{"key":"ref148","year":"2016","journal-title":"Pima Indians Diabetes DataSet"},{"key":"ref149","year":"0","journal-title":"North Carolina Voters Dataset"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4379(00)00022-3"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/235968.233324"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500845"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/276305.276312"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1002\/bs.3830120210"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/34.927466"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2002.1017616"},{"key":"ref52","first-page":"577","article-title":"Constrained k-means clustering with background knowledge","author":"wagstaff","year":"2001","journal-title":"Proc 18th Int Conf Mach Learn (ICML)"},{"key":"ref40","article-title":"The hardness of k-means clustering","author":"dasgupta","year":"2008"},{"key":"ref167","author":"dua","year":"2019","journal-title":"UCI Machine Learning Repository"},{"key":"ref166","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2010.04.019"},{"key":"ref165","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15561-1_16"},{"key":"ref164","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10599-4_7"},{"key":"ref163","first-page":"3","article-title":"A public domain dataset for human activity recognition using smartphones","volume":"3","author":"anguita","year":"2013","journal-title":"Proc ESANN"},{"key":"ref162","doi-asserted-by":"publisher","DOI":"10.1145\/2507157.2507163"},{"key":"ref161","article-title":"Labeled faces in the wild: A database forstudying face recognition in unconstrained environments","author":"huang","year":"2008","journal-title":"Proc Workshop Faces ‘Real-Life’ Images Detection Alignment Recognit"},{"key":"ref160","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330895"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1017\/can.2020.27"},{"key":"ref3","first-page":"327","article-title":"Big data and predictive reasonable suspicion","volume":"163","author":"ferguson","year":"2015","journal-title":"U Pa L Rev"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1111\/fima.12295"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1177\/0093854820969753"},{"key":"ref159","first-page":"1","article-title":"Open university learning analytics dataset","volume":"4","author":"kuzilek","year":"2017","journal-title":"Data Science Journal"},{"key":"ref8","first-page":"421","article-title":"Machine learning in financial crisis prediction: A survey","volume":"42","author":"lin","year":"2011","journal-title":"IEEE Trans Syst Man Cybern C Appl Rev"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2005.845141"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2009.08.003"},{"key":"ref157","first-page":"5","article-title":"Using data mining to predict secondary school student performance","author":"cortez","year":"2008","journal-title":"Proc 5th Annu Future Bus Technol Conf"},{"key":"ref158","year":"2021","journal-title":"Program for International Student Assessment"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3351095.3372828"},{"key":"ref46","first-page":"2440","article-title":"Hierarchical clustering in general metric spaces using approximate nearest neighbors","author":"moseley","year":"2021","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3321386"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1002\/widm.30"},{"key":"ref47","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","volume":"96","author":"ester","year":"1996","journal-title":"Proc KDD"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(83)90083-5"},{"key":"ref41","article-title":"K-medoids and p-median clustering are solvable in polynomial time for a 2d Pareto front","author":"dupin","year":"2018","journal-title":"arXiv 1806 02098"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"ref43","first-page":"405","article-title":"Clustering by means of medoids","author":"rdusseeun","year":"1987","journal-title":"Proc Stat Data Anal Based L1 Norm Conf"},{"key":"ref127","first-page":"1","article-title":"Fairness in clustering with multiple sensitive attributes","author":"abraham","year":"2020","journal-title":"Proc EDBT"},{"key":"ref126","article-title":"Fair clustering under a bounded cost","author":"esmaeili","year":"2021","journal-title":"arXiv 2106 07239"},{"key":"ref125","article-title":"Diversity-aware k-median: Clustering with fair center representation","author":"thejaswi","year":"2021","journal-title":"arXiv 2106 11696"},{"key":"ref124","article-title":"Tight FPT approximation for socially fair clustering","author":"goyal","year":"2021","journal-title":"arXiv 2106 06755"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/91.811242"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/91.995126"},{"key":"ref129","first-page":"1877","article-title":"How to solve fair k-center in massive data models","author":"chiplunkar","year":"2020","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/91.873580"},{"key":"ref128","first-page":"3448","article-title":"Fair k-center clustering for data summarization","author":"kleindessner","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/21.299710"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/3927.001.0001"},{"key":"ref130","first-page":"4940","article-title":"Fair k-centers via maximum matching","author":"jones","year":"2020","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/4235.771164"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/72.265956"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"ref133","doi-asserted-by":"publisher","DOI":"10.1209\/0295-5075\/89\/18001"},{"key":"ref134","doi-asserted-by":"publisher","DOI":"10.1063\/1.5107440"},{"key":"ref131","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412036"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1109\/3477.764879"},{"key":"ref132","article-title":"Principal fairness: Removing bias via projections","author":"anagnostopoulos","year":"2019","journal-title":"arXiv 1905 13651"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1145\/3457607"},{"key":"ref136","doi-asserted-by":"publisher","DOI":"10.1209\/0295-5075\/117\/28002"},{"key":"ref135","doi-asserted-by":"crossref","first-page":"2325","DOI":"10.1073\/pnas.1424644112","article-title":"Toward link predictability of complex networks","volume":"112","author":"linyuan","year":"2015","journal-title":"Proc Nat Acad Sci USA"},{"key":"ref138","first-page":"202","article-title":"Scaling up the accuracy of Naive-Bayes classifiers: A decision-tree hybrid","volume":"96","author":"kohavi","year":"1996","journal-title":"Proc Int'l Conf Knowledge Discovery and Data Mining"},{"key":"ref137","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5783"},{"key":"ref60","volume":"344","author":"kaufman","year":"2009","journal-title":"Finding Groups in Data An Introduction to Cluster Analysis"},{"key":"ref139","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2014.03.001"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v004.i02"},{"key":"ref61","first-page":"2481","article-title":"Solving inverse problems with piecewise linear estimators: From Gaussian mixture models to structured sparsity","volume":"21","author":"yu","year":"2011","journal-title":"IEEE Trans Image Process"},{"key":"ref63","first-page":"153","article-title":"Bayesian classification (AutoClass): Theory and results","volume":"180","author":"cheeseman","year":"1996","journal-title":"Advances in Knowledge Discovery and Data Mining"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"ref140","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/781670"},{"key":"ref65","first-page":"849","article-title":"On spectral clustering: Analysis and an algorithm","author":"ng","year":"2002","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref141","first-page":"196","article-title":"The learning curve method applied to clustering","author":"meek","year":"2001","journal-title":"Proc Int Workshop Artif Intell Statist"},{"key":"ref66","first-page":"305","article-title":"Learning spectral clustering","volume":"16","author":"bach","year":"2004","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref142","doi-asserted-by":"publisher","DOI":"10.1007\/11861461_10"},{"key":"ref67","first-page":"16","article-title":"Click: A clustering algorithm with applications to gene expression analysis","volume":"8","author":"sharan","year":"2000","journal-title":"Proc Int Conf Intell Syst Mol Biol"},{"key":"ref143","doi-asserted-by":"publisher","DOI":"10.1002\/asi.21001"},{"key":"ref68","first-page":"83","article-title":"A hypergraph based clustering algorithm for spatial data sets","author":"cherng","year":"2001","journal-title":"Proc IEEE Int Conf Data Mining"},{"key":"ref144","year":"2018","journal-title":"120 Years of Olympic History Athletes and Results"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1177\/0049124118782533"},{"key":"ref69","author":"bezdek","year":"2013","journal-title":"Pattern Recognition with Fuzzy Objective Function Algorithms"},{"key":"ref145","doi-asserted-by":"publisher","DOI":"10.1111\/j.1469-1809.1936.tb02137.x"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1111\/jels.12206"},{"key":"ref109","volume":"38","author":"mclachlan","year":"1988","journal-title":"Mixture Models Inference and Applications to Clustering"},{"key":"ref95","first-page":"2564","article-title":"Preventing fairness gerrymandering: Auditing and learning for subgroup fairness","author":"kearns","year":"2018","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref190","author":"basu","year":"2008","journal-title":"Constrained Clustering Advances in Algorithms Theory and Applications"},{"key":"ref108","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1966.tb00626.x"},{"key":"ref94","first-page":"1178","article-title":"A pairwise fair and community-preserving approach to k-center clustering","author":"brubach","year":"2020","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref191","first-page":"577","article-title":"Clustering with instance-level constraints","volume":"1097","author":"wagstaff","year":"2000","journal-title":"AAAI\/IAAI"},{"key":"ref107","doi-asserted-by":"publisher","DOI":"10.1143\/JPSJ.18.328"},{"key":"ref93","first-page":"1","article-title":"Proportionally fair clustering revisited","author":"micha","year":"2020","journal-title":"Proc 47th Int Colloq Automata Lang Program (ICALP)"},{"key":"ref192","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.31"},{"key":"ref106","first-page":"85","article-title":"Eine informationstheoretische ungleichung und ihre anwendung auf beweis der ergodizitaet von markoffschen ketten","volume":"8","author":"csiszar","year":"1964","journal-title":"Magyer Tud Akad Mat Kutato Int Koezl"},{"key":"ref92","article-title":"Improved approximation algorithms for individually fair clustering","author":"vakilian","year":"2021","journal-title":"arXiv 2106 14043"},{"key":"ref105","first-page":"1","article-title":"Fair hierarchical clustering","volume":"33","author":"ahmadian","year":"2020","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref91","article-title":"Better algorithms for individually fair k-clustering","author":"chakrabarty","year":"2021","journal-title":"arXiv 2106 12150"},{"key":"ref104","article-title":"Approximation algorithms for socially fair clustering","author":"makarychev","year":"2021","journal-title":"arXiv 2103 02512"},{"key":"ref90","article-title":"A new notion of individually fair clustering: $\\alpha$\n-equitable k-center","author":"chakrabarti","year":"2021","journal-title":"arXiv 2106 05423"},{"key":"ref103","first-page":"504","article-title":"Fair clustering via equitable group representations","author":"abbasi","year":"2021","journal-title":"Proc ACM Conf Fairness Accountability Transparency"},{"key":"ref102","article-title":"Towards fair deep clustering with multi-state protected variables","author":"wang","year":"2019","journal-title":"arXiv 1901 10053"},{"key":"ref111","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00909"},{"key":"ref112","article-title":"Fair clustering with multiple colors","author":"b\u00f6hm","year":"2020","journal-title":"arXiv 2002 07892"},{"key":"ref110","first-page":"720","author":"joyce","year":"2011","journal-title":"Kullback-Leibler Divergence"},{"key":"ref98","article-title":"On the cost of essentially fair clusterings","author":"bercea","year":"2019","journal-title":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques"},{"key":"ref99","first-page":"405","article-title":"Scalable fair clustering","author":"backurs","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1145\/3287560.3287592"},{"key":"ref97","first-page":"232","article-title":"Fair coresets and streaming algorithms for fair k-means","author":"schmidt","year":"2019","journal-title":"Proc Int Workshop Approximation Online Algorithms"},{"key":"ref10","first-page":"1","article-title":"Hiring algorithms: An ethnography of fairness in practice","author":"van den broek","year":"2020","journal-title":"Proc 40th Int Conf Inf Syst (ICIS)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2020.03.284"},{"key":"ref12","article-title":"Landing on the right job: A machine learning approach to match candidates with jobs applying semantic embeddings","author":"pombo","year":"2019"},{"key":"ref13","first-page":"1","article-title":"Automatic shortlisting of candidates in recruitment","author":"palshikar","year":"2018","journal-title":"Proc ProfS\/KG4IR\/Data Search (SIGIR)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v35i1.2504"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2016.0095"},{"key":"ref118","first-page":"1","article-title":"Probabilistic fair clustering","volume":"33","author":"esmaeili","year":"2020","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3388818.3393716"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2007.12.020"},{"key":"ref117","article-title":"Fair-capacitated clustering","author":"le quy","year":"2021","journal-title":"arXiv 2104 12116"},{"key":"ref17","article-title":"Fairness in machine learning: A survey","author":"caton","year":"2020","journal-title":"arXiv 2010 04053"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.2307\/1072940"},{"key":"ref18","first-page":"38","article-title":"False positives, false negatives, and false analyses: A rejoinder to machine bias: There’s software used across the country to predict future criminals. and it’s biased against blacks","volume":"80","author":"flores","year":"2016","journal-title":"Fed Probation"},{"key":"ref84","year":"2020","journal-title":"7 Findings That Illustrate Racial Disparities in Education"},{"key":"ref119","first-page":"4195","article-title":"Fair correlation clustering","author":"ahmadian","year":"2020","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref19","first-page":"1","article-title":"‘Fair’Risk assessments: A precarious approach for criminal justice reform","author":"green","year":"2018","journal-title":"Proc 5th Workshop Fairness Accountability Transparency Mach Learn"},{"key":"ref83","year":"2020","journal-title":"Racial Gender Wage Gaps Persist in U S Despite Some Progress"},{"key":"ref114","article-title":"A stochastic alternating balance k-means algorithm for fair clustering","author":"liu","year":"2021","journal-title":"arXiv 2105 14172"},{"key":"ref113","article-title":"Privacy preserving clustering with constraints","author":"r\u00f6sner","year":"2018","journal-title":"Proc 45th Int Colloq Automata Lang Program (ICALP)"},{"key":"ref116","article-title":"Fair clustering using antidote data","author":"chhabra","year":"2021","journal-title":"arXiv 2106 00600"},{"key":"ref80","article-title":"On the applicability of ML fairness notions","author":"makhlouf","year":"2020","journal-title":"arXiv 2006 16745"},{"key":"ref115","article-title":"Variational fair clustering","author":"ziko","year":"2019","journal-title":"arXiv 1906 08207"},{"key":"ref120","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45771-6_17"},{"key":"ref89","article-title":"Distributional individual fairness in clustering","author":"anderson","year":"2020","journal-title":"arXiv 2006 12589"},{"key":"ref121","first-page":"7587","article-title":"Coresets for clustering with fairness constraints","author":"huang","year":"2019","journal-title":"Proc NeurIPS"},{"key":"ref122","article-title":"On coresets for fair clustering in metric and Euclidean spaces and their applications","author":"bandyapadhyay","year":"2020","journal-title":"arXiv 2007 10137"},{"key":"ref123","first-page":"1","article-title":"KFC: A scalable approximation algorithm for k- center fair clustering","volume":"33","author":"harb","year":"2020","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref85","first-page":"4954","article-title":"Fair algorithms for clustering","volume":"32","author":"bera","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330987"},{"key":"ref87","article-title":"A notion of individual fairness for clustering","author":"kleindessner","year":"2020","journal-title":"arXiv 2006 04960"},{"key":"ref88","article-title":"A center in your neighborhood: Fairness in facility location","author":"jung","year":"2019","journal-title":"arXiv 1908 09041"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09541160.pdf?arnumber=9541160","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T14:55:40Z","timestamp":1639752940000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9541160\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":192,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3114099","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}