{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T04:28:00Z","timestamp":1729139280417,"version":"3.27.0"},"reference-count":85,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,3,20]],"date-time":"2023-03-20T00:00:00Z","timestamp":1679270400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,20]],"date-time":"2023-03-20T00:00:00Z","timestamp":1679270400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["SRG\/2020\/001138"],"id":[{"id":"10.13039\/501100001843","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,9]]},"DOI":"10.1007\/s10618-023-00928-6","type":"journal-article","created":{"date-parts":[[2023,3,20]],"date-time":"2023-03-20T15:02:51Z","timestamp":1679324571000},"page":"1959-1997","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient algorithms for fair clustering with a new notion of fairness"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-0633-3917","authenticated-orcid":false,"given":"Shivam","family":"Gupta","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-5049-4764","authenticated-orcid":false,"given":"Ganesh","family":"Ghalme","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-6132-0310","authenticated-orcid":false,"given":"Narayanan C.","family":"Krishnan","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-2666-9058","authenticated-orcid":false,"given":"Shweta","family":"Jain","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,20]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Abbasi M, Bhaskara A, Venkatasubramanian S (2021) Fair clustering via equitable group representations. In: Proceedings of the 2021 ACM conference on fairness, accountability, and transparency, pp 504\u2013514","key":"928_CR1","DOI":"10.1145\/3442188.3445913"},{"unstructured":"Abraham SS, Padmanabhan D, Sundaram SS (2020) Fairness in clustering with multiple sensitive attributes. In: EDBT\/ICDT 2020 joint conference, pp 287\u2013298","key":"928_CR2"},{"doi-asserted-by":"crossref","unstructured":"Ahmadian S, Epasto A, Kumar R, Mahdian M (2019) Clustering without over-representation. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery and data mining, pp 267\u2013275","key":"928_CR3","DOI":"10.1145\/3292500.3330987"},{"unstructured":"Ahmadian S, Epasto A, Kumar R, Mahdian M (2020) Fair correlation clustering. In: Chiappa S, Calandra R (eds) Proceedings of the twenty third international conference on artificial intelligence and statistics, volume 108 of proceedings of machine learning research, pp 4195\u20134205","key":"928_CR4"},{"unstructured":"Anderson N, Bera SK, Das S, Liu Y (2020) Distributional individual fairness in clustering. arXiv:2006.12589","key":"928_CR5"},{"doi-asserted-by":"crossref","unstructured":"Anegg G, Angelidakis H, Kurpisz A, Zenklusen R (2020) A technique for obtaining true approximations for k-center with covering constraints. In: International conference on integer programming and combinatorial optimization, pp 52\u201365. Springer","key":"928_CR6","DOI":"10.1007\/978-3-030-45771-6_5"},{"unstructured":"Backurs A, Indyk P, Onak K, Schieber B, Vakilian A, Wagner T (2019) Scalable fair clustering. In: International conference on machine learning, pp 405\u2013413","key":"928_CR7"},{"unstructured":"Bandyapadhyay S, Fomin FV, Simonov K (2020) On coresets for fair clustering in metric and euclidean spaces and their applications. arXiv:2007.10137","key":"928_CR8"},{"unstructured":"Bandyapadhyay S, Inamdar T, Pai S, Varadarajan K (2019) A constant approximation for colorful k-center. arXiv:1907.08906","key":"928_CR9"},{"issue":"3","key":"928_CR10","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10618-006-0040-z","volume":"13","author":"A Banerjee","year":"2006","unstructured":"Banerjee A, Ghosh J (2006) Scalable clustering algorithms with balancing constraints. Data Min Knowl Discov 13(3):365\u2013395","journal-title":"Data Min Knowl Discov"},{"doi-asserted-by":"crossref","unstructured":"Barocas S, Selbst AD (2016) Big data\u2019s disparate impact. California Law Rev, 671\u2013732","key":"928_CR11","DOI":"10.2139\/ssrn.2477899"},{"unstructured":"Baumann E, Rumberger JL (2018) State of the art in fair ML: from moral philosophy and legislation to fair classifiers. CoRR arXiv:1811.09539","key":"928_CR12"},{"key":"928_CR13","first-page":"4954","volume":"32","author":"S Bera","year":"2019","unstructured":"Bera S, Chakrabarty D, Flores N, Negahbani M (2019) Fair algorithms for clustering. Adv Neural Inf Process Syst 32:4954\u20134965","journal-title":"Adv Neural Inf Process Syst"},{"unstructured":"Bercea IO, Gro\u00df M, Khuller S, Kumar A, R\u00f6sner C, Schmidt DR, Schmidt M (2018) On the cost of essentially fair clusterings. arXiv:1811.10319","key":"928_CR14"},{"unstructured":"B\u00f6hm M, Fazzone A, Leonardi S, Schwiegelshohn C (2020) Fair clustering with multiple colors. arXiv:2002.07892","key":"928_CR15"},{"unstructured":"Bose A, Hamilton W (2019) Compositional fairness constraints for graph embeddings. In: International conference on machine learning, pp 715\u2013724","key":"928_CR16"},{"unstructured":"Bottou L, Bengio Y (1994) Convergence properties of the k-means algorithms. Advances in neural information processing systems\u00a07","key":"928_CR17"},{"unstructured":"Brubach B, Chakrabarti D, Dickerson J, Khuller S, Srinivasan A, Tsepenekas L (2020) A pairwise fair and community-preserving approach to k-center clustering. In: International conference on machine learning, pp 1178\u20131189","key":"928_CR18"},{"doi-asserted-by":"crossref","unstructured":"Brubach B, Chakrabarti D, Dickerson JP, Srinivasan A, Tsepenekas L (2021) Fairness, semi-supervised learning, and more: A general framework for clustering with stochastic pairwise constraints. In: Proceedings of the AAAI conference on artificial intelligence, vol\u00a035, pp 6822\u20136830","key":"928_CR19","DOI":"10.1609\/aaai.v35i8.16842"},{"doi-asserted-by":"crossref","unstructured":"Byrka J, Pensyl T, Rybicki B, Srinivasan A, Trinh K (2014) An improved approximation for k-median, and positive correlation in budgeted optimization. In: Proceedings of the twenty-sixth annual ACM-SIAM symposium on discrete algorithms, pp 737\u2013756. SIAM","key":"928_CR20","DOI":"10.1137\/1.9781611973730.50"},{"doi-asserted-by":"crossref","unstructured":"Carey AN, Wu X (2022) The fairness field guide: perspectives from social and formal sciences. arXiv:2201.05216","key":"928_CR21","DOI":"10.3389\/fdata.2022.892837"},{"unstructured":"Chakrabarti D, Dickerson JP, Esmaeili SA, Srinivasan A, Tsepenekas L (2022) A new notion of individually fair clustering: $$\\alpha $$-equitable $$k$$-center. In: International conference on artificial intelligence and statistics, pp 6387\u20136408","key":"928_CR22"},{"doi-asserted-by":"crossref","unstructured":"Chan TH, Guerqin A, Sozio M (2018) Fully dynamic k-center clustering. In: Proceedings of the 2018 World Wide Web conference, pp 579\u2013587","key":"928_CR23","DOI":"10.1145\/3178876.3186124"},{"unstructured":"Chen X, Fain B, Lyu L, Munagala K (2019) Proportionally fair clustering. In: International conference on machine learning, pp 1032\u20131041","key":"928_CR24"},{"key":"928_CR25","doi-asserted-by":"publisher","first-page":"130698","DOI":"10.1109\/ACCESS.2021.3114099","volume":"9","author":"A Chhabra","year":"2021","unstructured":"Chhabra A, Masalkovait\u0117 K, Mohapatra P (2021) An overview of fairness in clustering. IEEE Access 9:130698\u2013130720. https:\/\/doi.org\/10.1109\/ACCESS.2021.3114099","journal-title":"IEEE Access"},{"unstructured":"Chhabra A, Singla A, Mohapatra P (2021) Fair clustering using antidote data. arXiv:2106.00600","key":"928_CR26"},{"unstructured":"Chierichetti F, Kumar R, Lattanzi S, Vassilvitskii S (2017) Fair clustering through fairlets. In: Proceedings of the 31st international conference on neural information processing systems, pp 5036\u20135044","key":"928_CR27"},{"unstructured":"Chikahara Y, Sakaue S, Fujino A, Kashima H (2021) Learning individually fair classifier with path-specific causal-effect constraint. In: International conference on artificial intelligence and statistics, pp 145\u2013153","key":"928_CR28"},{"doi-asserted-by":"crossref","unstructured":"Chlamt\u00e1\u010d E, Makarychev Y, Vakilian A (2022) Approximating fair clustering with cascaded norm objectives. In: Proceedings of the 2022 annual ACM-SIAM symposium on discrete algorithms (SODA), pp 2664\u20132683. SIAM","key":"928_CR29","DOI":"10.1137\/1.9781611977073.104"},{"doi-asserted-by":"crossref","unstructured":"Cho J, Hwang G, Suh C (2020) A fair classifier using mutual information. In: 2020 IEEE international symposium on information theory (ISIT), pp 2521\u20132526","key":"928_CR30","DOI":"10.1109\/ISIT44484.2020.9174293"},{"unstructured":"Correa J, Cristi A, Duetting P, Norouzi-Fard A (2021) Fairness and bias in online selection. In: International conference on machine learning, pp 2112\u20132121","key":"928_CR31"},{"unstructured":"Dastin J (2018) Amazon scraps secret ai recruiting tool that showed bias against women. https:\/\/www.reuters.com\/article\/us-amazon-com-jobs-automation-insight-idUSKCN1MK08G. [Online; accessed 15-August-2021]","key":"928_CR32"},{"doi-asserted-by":"crossref","unstructured":"Davidson I, Ravi S (2020) Making existing clusterings fairer: algorithms, complexity results and insights. In: Proceedings of the AAAI conference on artificial intelligence, vol\u00a034, pp 3733\u20133740","key":"928_CR33","DOI":"10.1609\/aaai.v34i04.5783"},{"unstructured":"Deepak, Abraham SS (2020). Representativity fairness in clustering. In: 12th ACM conference on web science","key":"928_CR34"},{"doi-asserted-by":"crossref","unstructured":"Deepak JM, Jose SV (2020) Fairness in unsupervised learning. In: Proceedings of the 29th ACM international conference on information & knowledge management, CIKM \u201920, New York, NY, USA, pp 3511\u20133512. Association for Computing Machinery","key":"928_CR35","DOI":"10.1145\/3340531.3412175"},{"doi-asserted-by":"crossref","unstructured":"Dwork C, Hardt M, Pitassi T, Reingold O, Zemel R (2012) Fairness through awareness. In: Proceedings of the 3rd innovations in theoretical computer science conference, pp 214\u2013226","key":"928_CR36","DOI":"10.1145\/2090236.2090255"},{"doi-asserted-by":"crossref","unstructured":"Elzayn H, Jabbari S, Jung C, Kearns M, Neel S, Roth A, Schutzman Z (2019) Fair algorithms for learning in allocation problems. In: Proceedings of the conference on fairness, accountability, and transparency, pp 170\u2013179","key":"928_CR37","DOI":"10.1145\/3287560.3287571"},{"key":"928_CR38","first-page":"14345","volume":"34","author":"S Esmaeili","year":"2021","unstructured":"Esmaeili S, Brubach B, Srinivasan A, Dickerson J (2021) Fair clustering under a bounded cost. Adv Neural Inf Process Syst 34:14345\u201314357","journal-title":"Adv Neural Inf Process Syst"},{"key":"928_CR39","first-page":"12743","volume":"33","author":"S Esmaeili","year":"2020","unstructured":"Esmaeili S, Brubach B, Tsepenekas L, Dickerson J (2020) Probabilistic fair clustering. Adv Neural Inf Process Syst 33:12743\u201312755","journal-title":"Adv Neural Inf Process Syst"},{"unstructured":"Feng Z, Kacham P, Woodruff D (2021) Dimensionality reduction for the sum-of-distances metric. In: International conference on machine learning, pp 3220\u20133229","key":"928_CR40"},{"doi-asserted-by":"crossref","unstructured":"Ghadiri M, Samadi S, Vempala S (2021) Socially fair k-means clustering. In: Proceedings of the 2021 ACM conference on fairness, accountability, and transparency, pp 438\u2013448","key":"928_CR41","DOI":"10.1145\/3442188.3445906"},{"doi-asserted-by":"crossref","unstructured":"Ghadiri M, Singh M, Vempala SS (2022) Constant-factor approximation algorithms for socially fair $$ k $$-clustering. arXiv preprint arXiv:2206.11210","key":"928_CR42","DOI":"10.1145\/3442188.3445906"},{"doi-asserted-by":"crossref","unstructured":"Gong S, Liu X, Jain AK (2021) Mitigating face recognition bias via group adaptive classifier. In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition, pp 3414\u20133424","key":"928_CR43","DOI":"10.1109\/CVPR46437.2021.00342"},{"doi-asserted-by":"crossref","unstructured":"Goyal D, Jaiswal R (2021) Tight fpt approximation for socially fair clustering. arXiv:2106.06755","key":"928_CR44","DOI":"10.2139\/ssrn.4226483"},{"doi-asserted-by":"crossref","unstructured":"Han L, Xu D, Xu Y, Yang P (2022) Approximation algorithms for the individually fair k-center with outliers. J Global Optim, 1\u201316","key":"928_CR45","DOI":"10.1007\/s10898-022-01195-3"},{"key":"928_CR46","first-page":"14509","volume":"33","author":"E Harb","year":"2020","unstructured":"Harb E, Lam HS (2020) KFC: a scalable approximation algorithm for $$ k $$- center fair clustering. Adv Neural Inf Process Syst 33:14509\u201314519","journal-title":"Adv Neural Inf Process Syst"},{"issue":"3","key":"928_CR47","first-page":"1","volume":"15","author":"DG Harris","year":"2019","unstructured":"Harris DG, Pensyl T, Srinivasan A, Trinh K (2019) A lottery model for center-type problems with outliers. ACM Trans Algorithms 15(3):1\u201325","journal-title":"ACM Trans Algorithms"},{"key":"928_CR48","first-page":"7589","volume":"32","author":"L Huang","year":"2019","unstructured":"Huang L, Jiang S, Vishnoi N (2019) Coresets for clustering with fairness constraints. Adv Neural Inf Process Syst 32:7589\u20137600","journal-title":"Adv Neural Inf Process Syst"},{"doi-asserted-by":"crossref","unstructured":"Jia X, Sheth K, Svensson O (2020) Fair colorful k-center clustering. In: International conference on integer programming and combinatorial optimization, pp 209\u2013222. Springer","key":"928_CR49","DOI":"10.1007\/978-3-030-45771-6_17"},{"unstructured":"Jones M, Nguyen H, Nguyen T (2020) Fair k-centers via maximum matching. In: International conference on machine learning, pp 4940\u20134949","key":"928_CR50"},{"unstructured":"Julia A, Larson J, Mattu S, Kirchner L (2016) Propublica\u2013machine bias. https:\/\/www.propublica.org\/article\/machine-bias-risk-assessments-in-criminal-sentencing. [Online; accessed 13-August-2021]","key":"928_CR51"},{"unstructured":"Jung C, Kannan S, Lutz N (2020) Service in your neighborhood: fairness in center location. Foundations of Responsible Computing (FORC)","key":"928_CR52"},{"unstructured":"Kalyanakrishnan S (2016) $$k$$-means clustering. https:\/\/www.cse.iitb.ac.in\/~shivaram\/teaching\/old\/cs344+386-s2017\/resources\/classnote-2.pdf. [Online; accessed 29-May-2022]","key":"928_CR53"},{"unstructured":"Kar D, Medya S, Mandal D, Silva A, Dey P, Sanyal S (2021) Feature-based individual fairness in k-clustering. arXiv:2109.04554","key":"928_CR54"},{"unstructured":"Kleindessner M, Awasthi P, Morgenstern J (2019) Fair k-center clustering for data summarization. In: International conference on machine learning, pp 3448\u20133457","key":"928_CR55"},{"unstructured":"Kleindessne M, Awasthi P, Morgenstern J (2020) A notion of individual fairness for clustering. arXiv:2006.04960","key":"928_CR56"},{"unstructured":"Kleindessner M, Samadi S, Awasthi P, Morgenstern J (2019) Guarantees for spectral clustering with fairness constraints. In: International conference on machine learning, pp 3458\u20133467","key":"928_CR57"},{"unstructured":"Krause A (2016) Clustering and $$k$$-means. https:\/\/las.inf.ethz.ch\/courses\/lis-s16\/hw\/hw4_sol.pdf. [Online; accessed 29-May-2022]","key":"928_CR58"},{"issue":"2","key":"928_CR59","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10115-016-1004-2","volume":"52","author":"HP Kriegel","year":"2017","unstructured":"Kriegel HP, Schubert E, Zimek A (2017) The (black) art of runtime evaluation: are we comparing algorithms or implementations? Knowl Inf Syst 52(2):341\u2013378. https:\/\/doi.org\/10.1007\/s10115-016-1004-2","journal-title":"Knowl Inf Syst"},{"unstructured":"Le\u00a0Quy T, Ntoutsi E (2021) Towards fair, explainable and actionable clustering for learning analytics. In: EDM","key":"928_CR60"},{"doi-asserted-by":"crossref","unstructured":"Le\u00a0Quy T, Roy A, Iosifidis V, Zhang W, Ntoutsi E (2022) A survey on datasets for fairness-aware machine learning. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, e1452","key":"928_CR61","DOI":"10.1002\/widm.1452"},{"unstructured":"Lee JK, Bu Y, Rajan D, Sattigeri P, Panda R, Das S, Wornell GW (2021) Fair selective classification via sufficiency. In: International conference on machine learning, pp 6076\u20136086","key":"928_CR62"},{"unstructured":"Li B, Li L, Sun A, Wang C, Wang Y (2021) Approximate group fairness for clustering. In: International conference on machine learning, pp 6381\u20136391","key":"928_CR63"},{"doi-asserted-by":"crossref","unstructured":"Li P, Zhao H, Liu H (2020) Deep fair clustering for visual learning. In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition (CVPR)","key":"928_CR64","DOI":"10.1109\/CVPR42600.2020.00909"},{"doi-asserted-by":"crossref","unstructured":"Liu S, Vicente LN (2021) A stochastic alternating balance $$ k $$-means algorithm for fair clustering. arXiv:2105.14172","key":"928_CR65","DOI":"10.1007\/978-3-031-24866-5_6"},{"unstructured":"Lohaus M, Perrot M, Luxburg UV (2020) Too relaxed to be fair. In: III HD, Singh A (eds) Proceedings of the 37th international conference on machine learning, vol. 119 of proceedings of machine learning research, pp 6360\u20136369","key":"928_CR66"},{"unstructured":"Mahabadi S, Vakilian A (2020) Individual fairness for k-clustering. In: International conference on machine learning, pp 6586\u20136596","key":"928_CR67"},{"unstructured":"Makarychev Y, Vakilian A (2021) Approximation algorithms for socially fair clustering. arXiv:2103.02512","key":"928_CR68"},{"doi-asserted-by":"publisher","unstructured":"Mehrabi N, Morstatter F, Saxena N, Lerman K, Galstyan A (2021) A survey on bias and fairness in machine learning. ACM Comput Surv\u00a054(6). https:\/\/doi.org\/10.1145\/3457607","key":"928_CR69","DOI":"10.1145\/3457607"},{"unstructured":"Micha E, Shah N (2020) Proportionally fair clustering revisited. In: 47th international colloquium on automata, languages, and pogramming (ICALP 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik","key":"928_CR70"},{"key":"928_CR71","first-page":"13340","volume":"34","author":"M Negahbani","year":"2021","unstructured":"Negahbani M, Chakrabarty D (2021) Better algorithms for individually fair $$ k $$-clustering. Adv Neural Inf Process Syst 34:13340\u201313351","journal-title":"Adv Neural Inf Process Syst"},{"issue":"3","key":"928_CR72","doi-asserted-by":"publisher","first-page":"e1356","DOI":"10.1002\/widm.1356","volume":"10","author":"E Ntoutsi","year":"2020","unstructured":"Ntoutsi E, Fafalios P, Gadiraju U, Iosifidis V, Nejdl W, Vidal ME, Ruggieri S, Turini F, Papadopoulos S, Krasanakis E et al (2020) Bias in data-driven artificial intelligence systems-an introductory survey. Wiley Interdiscip Rev Data Min Knowl Discov 10(3):e1356","journal-title":"Wiley Interdiscip Rev Data Min Knowl Discov"},{"unstructured":"Padmanabhan D (2020) Whither fair clustering? In: AI for social good: Harvard CRCS Workshop","key":"928_CR73"},{"unstructured":"Quy TL, Roy A, Friege G, Ntoutsi E (2021) Fair-capacitated clustering. arXiv:2104.12116","key":"928_CR74"},{"unstructured":"Ranzato F, Urban C, Zanella M (2021) Fair training of decision tree classifiers. arXiv:2101.00909","key":"928_CR75"},{"unstructured":"R\u00f6sner C, Schmidt M (2018) Privacy preserving clustering with constraints. arXiv:1802.02497","key":"928_CR76"},{"doi-asserted-by":"crossref","unstructured":"Schmidt M, Schwiegelshohn C, Sohler C (2019) Fair coresets and streaming algorithms for fair k-means. In: International Workshop on Approximation and Online Algorithms, pp 232\u2013251. Springer","key":"928_CR77","DOI":"10.1007\/978-3-030-39479-0_16"},{"unstructured":"Schmidt M, Wargalla J (2021) Coresets for constrained k-median and k-means clustering in low dimensional euclidean space. arXiv:2106.07319","key":"928_CR78"},{"doi-asserted-by":"crossref","unstructured":"Song H, Li P, Liu H (2021) Deep clustering based fair outlier detection. In: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery &; Data Mining, KDD \u201921, New York, NY, USA, pp 1481-1489. Association for Computing Machinery","key":"928_CR79","DOI":"10.1145\/3447548.3467225"},{"doi-asserted-by":"crossref","unstructured":"Thejaswi S, Ordozgoiti B, Gionis A (2021) Diversity-aware k-median: Clustering with fair center representation. In: Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pp 765\u2013780. Springer","key":"928_CR80","DOI":"10.1007\/978-3-030-86520-7_47"},{"unstructured":"Vakilian A, Yalciner M (2022) Improved approximation algorithms for individually fair clustering. In: International Conference on Artificial Intelligence and Statistics, pp 8758\u20138779. PMLR","key":"928_CR81"},{"unstructured":"Wang B, Davidson I (2019) Towards fair deep clustering with multi-state protected variables. arXiv preprint arXiv:1901.10053","key":"928_CR82"},{"unstructured":"Zhang H, Davidson I (2021) Deep fair discriminative clustering. arXiv preprint arXiv:2105.14146","key":"928_CR83"},{"doi-asserted-by":"crossref","unstructured":"Zhang W, Bifet A, Zhang X, Weiss JC, Nejdl W (2021) Farf: A fair and adaptive random forests classifier, Advances in Knowledge Discovery and Data Mining, 245\u2013256. Springer International Publishing","key":"928_CR84","DOI":"10.1007\/978-3-030-75765-6_20"},{"doi-asserted-by":"crossref","unstructured":"Ziko IM, Yuan J, Granger E, Ayed IB (2021) Variational fair clustering. In: Proceedings of the AAAI Conference on Artificial Intelligence, Volume\u00a035, pp 11202\u201311209","key":"928_CR85","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-023-00928-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-023-00928-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-023-00928-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T18:15:13Z","timestamp":1729102513000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-023-00928-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,20]]},"references-count":85,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["928"],"URL":"https:\/\/doi.org\/10.1007\/s10618-023-00928-6","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2023,3,20]]},"assertion":[{"value":"31 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No potential competing interest was reported by the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The code has been made publicly available at","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}},{"value":"Not applicable","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"The paper is the authors\u2019 own original work, which has not been previously published elsewhere. The paper is not currently being considered for publication elsewhere. The paper reflects the authors\u2019 own research and analysis in a truthful and complete manner. The paper properly credits the meaningful contributions of co-authors and co-researchers.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}