{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T12:37:21Z","timestamp":1771850241310,"version":"3.50.1"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031606014","type":"print"},{"value":"9783031605994","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-60599-4_2","type":"book-chapter","created":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T09:02:09Z","timestamp":1716800529000},"page":"20-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Fair Minimum Representation Clustering"],"prefix":"10.1007","author":[{"given":"Connor","family":"Lawless","sequence":"first","affiliation":[]},{"given":"Oktay","family":"G\u00fcnl\u00fck","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,25]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Abbasi, M., Bhaskara, A., Venkatasubramanian, S.: Fair clustering via equitable group representations. In: Proceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency, pp. 504\u2013514. ACM, New York (2021)","DOI":"10.1145\/3442188.3445913"},{"key":"2_CR2","unstructured":"Ahmadian, S., et al.: Fair hierarchical clustering. In: Advances in Neural Information Processing Systems, vol. 33, pp. 21050\u201321060 (2020)"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Ahmadian, S., Epasto, A., Kumar, R., Mahdian, M.: Clustering without over-representation. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 267\u2013275. ACM, New York (2019)","DOI":"10.1145\/3292500.3330987"},{"key":"2_CR4","unstructured":"Backurs, A., Indyk, P., Onak, K., Schieber, B., Vakilian, A., Wagner, T.: Scalable fair clustering. In: International Conference on Machine Learning, pp. 405\u2013413. PMLR, Long Beach (2019)"},{"key":"2_CR5","unstructured":"Bandyapadhyay, S., Fomin, F.V., Simonov, K.: On coresets for fair clustering in metric and Euclidean spaces and their applications (2020). arXiv:2007.10137"},{"key":"2_CR6","unstructured":"Bera, S., Chakrabarty, D., Flores, N., Negahbani, M.: Fair algorithms for clustering. In: Wallach, H., Larochelle, H., Beygelzimer, A., d\u2019 Alch\u00e9-Buc, F., Fox, E., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol.\u00a032. Curran Associates, Inc., Vancouver (2019). https:\/\/proceedings.neurips.cc\/paper\/2019\/file\/fc192b0c0d270dbf41870a63a8c76c2f-Paper.pdf"},{"key":"2_CR7","unstructured":"Bercea, I.O., et al.: On the cost of essentially fair clusterings (2018). arXiv:1811.10319"},{"key":"2_CR8","unstructured":"B\u00f6hm, M., Fazzone, A., Leonardi, S., Schwiegelshohn, C.: Fair clustering with multiple colors (2020). arXiv:2002.07892"},{"key":"2_CR9","unstructured":"Brownwell, C.: CRTC relaxes quotas on Canadian content for tv broadcasters (2015). https:\/\/financialpost.com\/technology\/crtc-relaxes-quotas-on-canadian-content-for-tv-broadcasters"},{"key":"2_CR10","unstructured":"Buolamwini, J., Gebru, T.: Gender shades: intersectional accuracy disparities in commercial gender classification. In: Conference on Fairness, Accountability and Transparency, pp. 77\u201391. PMLR, New York City (2018)"},{"key":"2_CR11","unstructured":"Chhabra, A., Vashishth, V., Mohapatra, P.: Fair algorithms for hierarchical agglomerative clustering (2020). arXiv:2005.03197"},{"key":"2_CR12","unstructured":"Chierichetti, F., Kumar, R., Lattanzi, S., Vassilvitskii, S.: Fair clustering through fairlets. In: Guyon, I., et al. (eds.) Advances in Neural Information Processing Systems, vol.\u00a030. Curran Associates, Inc., Long Beach (2017). https:\/\/proceedings.neurips.cc\/paper\/2017\/file\/978fce5bcc4eccc88ad48ce3914124a2-Paper.pdf"},{"key":"2_CR13","unstructured":"Chiplunkar, A., Kale, S., Ramamoorthy, S.N.: How to solve fair k-center in massive data models. In: International Conference on Machine Learning, pp. 1877\u20131886. PMLR, Remote (2020)"},{"issue":"7","key":"2_CR14","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1007\/s11760-019-01488-3","volume":"13","author":"SM Daudpota","year":"2019","unstructured":"Daudpota, S.M., Muhammad, A., Baber, J.: Video genre identification using clustering-based shot detection algorithm. Signal Image Video Process. 13(7), 1413\u20131420 (2019)","journal-title":"Signal Image Video Process."},{"key":"2_CR15","unstructured":"Dua, D., Graff, C., et\u00a0al.: UCI machine learning repository (2017)"},{"key":"2_CR16","unstructured":"Esmaeili, S., Brubach, B., Srinivasan, A., Dickerson, J.: Fair clustering under a bounded cost. In: Advances in Neural Information Processing Systems, vol. 34, pp. 14345\u201314357 (2021)"},{"key":"2_CR17","unstructured":"Esmaeili, S., Brubach, B., Tsepenekas, L., Dickerson, J.: Probabilistic fair clustering. In: Advances in Neural Information Processing Systems, vol. 33, pp. 12743\u201312755 (2020)"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Esmaeili, S.A., Duppala, S., Dickerson, J.P., Brubach, B.: Fair labeled clustering. In: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 327\u2013335 (2022)","DOI":"10.1145\/3534678.3539451"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Ghadiri, M., Samadi, S., Vempala, S.: Socially fair k-means clustering. In: Proceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency, pp. 438\u2013448. ACM, Online (2021)","DOI":"10.1145\/3442188.3445906"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Goyal, D., Jaiswal, R.: Tight FPT approximation for socially fair clustering (2021). arXiv:2106.06755","DOI":"10.2139\/ssrn.4226483"},{"key":"2_CR21","unstructured":"Gurobi Optimization, LLC: Gurobi Optimizer Reference Manual (2022). https:\/\/www.gurobi.com"},{"key":"2_CR22","unstructured":"Harb, E., Lam, H.S.: Kfc: A scalable approximation algorithm for $$ k $$-center fair clustering. In: Advances in Neural Information Processing Systems, vol. 33, pp. 14509\u201314519 (2020)"},{"key":"2_CR23","unstructured":"Huang, L., Jiang, S., Vishnoi, N.: Coresets for clustering with fairness constraints. In: Advances in Neural Information Processing Systems, vol. 32 (2019)"},{"issue":"3","key":"2_CR24","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"AK Jain","year":"1999","unstructured":"Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: a review. ACM Comput. Surv. (CSUR) 31(3), 264\u2013323 (1999)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-030-45771-6_17","volume-title":"Integer Programming and Combinatorial Optimization","author":"X Jia","year":"2020","unstructured":"Jia, X., Sheth, K., Svensson, O.: Fair colorful k-center clustering. In: Bienstock, D., Zambelli, G. (eds.) IPCO 2020. LNCS, vol. 12125, pp. 209\u2013222. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45771-6_17"},{"key":"2_CR26","unstructured":"Jones, M., Nguyen, H., Nguyen, T.: Fair k-centers via maximum matching. In: International Conference on Machine Learning, pp. 4940\u20134949. PMLR, Virtual (2020)"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Kansal, T., Bahuguna, S., Singh, V., Choudhury, T.: Customer segmentation using k-means clustering. In: 2018 International Conference on Computational Techniques, Electronics and Mechanical Systems (CTEMS), pp. 135\u2013139. IEEE, Belgaum (2018)","DOI":"10.1109\/CTEMS.2018.8769171"},{"key":"2_CR28","unstructured":"Kleindessner, M., Awasthi, P., Morgenstern, J.: Fair k-center clustering for data summarization. In: International Conference on Machine Learning, pp. 3448\u20133457. PMLR, Long Beach (2019)"},{"key":"2_CR29","unstructured":"Kleindessner, M., Samadi, S., Awasthi, P., Morgenstern, J.: Guarantees for spectral clustering with fairness constraints. In: International Conference on Machine Learning, pp. 3458\u20133467. PMLR, Long Beach (2019)"},{"key":"2_CR30","unstructured":"Le\u00a0Quy, T., Roy, A., Friege, G., Ntoutsi, E.: Fair-capacitated clustering. In: EDM. EDM, Paris (2021)"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Liu, S., Vicente, L.N.: A stochastic alternating balance $$ k $$-means algorithm for fair clustering (2021). arXiv:2105.14172","DOI":"10.1007\/978-3-031-24866-5_6"},{"key":"2_CR32","unstructured":"Makarychev, Y., Vakilian, A.: Approximation algorithms for socially fair clustering. In: Conference on Learning Theory, pp. 3246\u20133264. PMLR, Boulder (2021)"},{"key":"2_CR33","unstructured":"Mehrabi, N., Morstatter, F., Saxena, N., Lerman, K., Galstyan, A.: A survey on bias and fairness in machine learning (2019). arXiv:1908.09635"},{"key":"2_CR34","unstructured":"NCSBE: North Carolina voter registration data (2020). https:\/\/www.ncsbe.gov\/results-data\/voter-registration-data"},{"key":"2_CR35","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"2_CR36","unstructured":"Schmidt, M., Schwiegelshohn, C., Sohler, C.: Fair coresets and streaming algorithms for fair k-means clustering (2018). arXiv:1812.10854"},{"key":"2_CR37","doi-asserted-by":"crossref","unstructured":"Thejaswi, S., Ordozgoiti, B., Gionis, A.: Diversity-aware $$ k $$-median: clustering with fair center representation (2021). arXiv:2106.11696","DOI":"10.1007\/978-3-030-86520-7_47"},{"key":"2_CR38","doi-asserted-by":"publisher","first-page":"103364","DOI":"10.1016\/j.jbi.2019.103364","volume":"102","author":"Y Wang","year":"2020","unstructured":"Wang, Y., et al.: Unsupervised machine learning for the discovery of latent disease clusters and patient subgroups using electronic health records. J. Biomed. Inform. 102, 103364 (2020)","journal-title":"J. Biomed. Inform."},{"issue":"3","key":"2_CR39","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1109\/TNN.2005.845141","volume":"16","author":"R Xu","year":"2005","unstructured":"Xu, R., Wunsch, D.: Survey of clustering algorithms. IEEE Trans. Neural Netw. 16(3), 645\u2013678 (2005)","journal-title":"IEEE Trans. Neural Netw."},{"key":"2_CR40","doi-asserted-by":"crossref","unstructured":"Ziko, I.M., Yuan, J., Granger, E., Ayed, I.B.: Variational fair clustering. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a035, pp. 11202\u201311209. AAAI, Virtual (2021)","DOI":"10.1609\/aaai.v35i12.17336"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-60599-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T09:02:50Z","timestamp":1716800570000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-60599-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031606014","9783031605994"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-60599-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"25 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Uppsala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}