{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T02:40:57Z","timestamp":1755830457149,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T00:00:00Z","timestamp":1724457600000},"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":[[2024,8,25]]},"DOI":"10.1145\/3637528.3672005","type":"proceedings-article","created":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T00:54:55Z","timestamp":1724547295000},"page":"2189-2199","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Fair Column Subset Selection"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1003-7101","authenticated-orcid":false,"given":"Antonis","family":"Matakos","sequence":"first","affiliation":[{"name":"Aalto University, Espoo, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6938-3159","authenticated-orcid":false,"given":"Bruno","family":"Ordozgoiti","sequence":"additional","affiliation":[{"name":"Unaffiliated, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0992-8759","authenticated-orcid":false,"given":"Suhas","family":"Thejaswi","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Software Systems, Kaiserslautern, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,8,24]]},"reference":[{"unstructured":"Jason Altschuler Aditya Bhaskara Gang Fu Vahab Mirrokni Afshin Rostamizadeh and Morteza Zadimoghaddam. 2016. Greedy column subset selection: New bounds and distributed algorithms. In ICML. PMLR 2539--2548.","key":"e_1_3_2_2_1_1"},{"doi-asserted-by":"crossref","unstructured":"Aris Anagnostopoulos Luca Becchetti Adriano Fazzone Cristina Menghini and Chris Schwiegelshohn. 2020. Spectral relaxations and fair densest subgraphs. In CIKM. ACM 35--44.","key":"e_1_3_2_2_2_1","DOI":"10.1145\/3340531.3412036"},{"unstructured":"Solon Barocas Moritz Hardt and Arvind Narayanan. 2019. Fairness and Machine Learning: Limitations and Opportunities. fairmlbook.org. http:\/\/www.fairmlbook.org.","key":"e_1_3_2_2_3_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_4_1","DOI":"10.1137\/12086755X"},{"doi-asserted-by":"crossref","unstructured":"Christos Boutsidis Michael W Mahoney and Petros Drineas. 2008. Unsupervised feature selection for principal components analysis. In KDD. 61--69.","key":"e_1_3_2_2_5_1","DOI":"10.1145\/1401890.1401903"},{"volume-title":"SODA (SODA '09)","author":"Boutsidis Christos","unstructured":"Christos Boutsidis, Michael W. Mahoney, and Petros Drineas. 2009. An Improved Approximation Algorithm for the Column Subset Selection Problem. In SODA (SODA '09). SIAM, 968--977.","key":"e_1_3_2_2_6_1"},{"unstructured":"Joy Buolamwini and Timnit Gebru. 2018. Gender shades: Intersectional accuracy disparities in commercial gender classification. In FAccT. PMLR 77--91.","key":"e_1_3_2_2_7_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_8_1","DOI":"10.1002\/nla.1680010105"},{"key":"e_1_3_2_2_9_1","volume-title":"Rank revealing QR factorizations. Linear Algebra and its Applic","author":"Chan Tony F.","year":"1987","unstructured":"Tony F. Chan. 1987. Rank revealing QR factorizations. Linear Algebra and its Applic., Vol. 88--89 (1987), 67--82."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_10_1","DOI":"10.1109\/ACCESS.2021.3114099"},{"volume-title":"NeuRIPS. Curran Associates","author":"Chierichetti Flavio","unstructured":"Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, and Sergei Vassilvitskii. 2017. Fair Clustering Through Fairlets. In NeuRIPS. Curran Associates, Inc., 5029--5037.","key":"e_1_3_2_2_11_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_12_1","DOI":"10.1097\/MLR.0b013e3181a23e3a"},{"volume-title":"Efficient","author":"Deshpande Amit","unstructured":"Amit Deshpande and Luis Rademacher. 2010. Efficient volume sampling for row\/column subset selection. In FCS. IEEE, 329--338.","key":"e_1_3_2_2_13_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_14_1","DOI":"10.4086\/toc.2006.v002a012"},{"unstructured":"Dheeru Dua and Casey Graff. 2017. UCI Machine Learning Repository. http:\/\/archive.ics.uci.edu\/ml","key":"e_1_3_2_2_15_1"},{"doi-asserted-by":"crossref","unstructured":"Cynthia Dwork Moritz Hardt Toniann Pitassi Omer Reingold and Richard Zemel. 2012. Fairness through awareness. In Innovations in TCS. ACM 214--226.","key":"e_1_3_2_2_16_1","DOI":"10.1145\/2090236.2090255"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_17_1","DOI":"10.1007\/s10115-014-0801--8"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_18_1","DOI":"10.1609\/aaai.v36i6.20617"},{"unstructured":"M. R. Garey and D. S. Johnson. 1979. Computers and Intractability. W. H. Freeman.","key":"e_1_3_2_2_19_1"},{"doi-asserted-by":"crossref","unstructured":"Mehrdad Ghadiri Samira Samadi and Santosh Vempala. 2021. Socially fair k-means clustering. In FAccT. ACM 438--448.","key":"e_1_3_2_2_20_1","DOI":"10.1145\/3442188.3445906"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_21_1","DOI":"10.1007\/BF01436075"},{"key":"e_1_3_2_2_22_1","first-page":"213","article-title":"Rank-Revealing QR Factorizations and the Singular Value Decomposition","volume":"58","author":"Hong Y","year":"1992","unstructured":"Y Hong and C. T. Pan. 1992. Rank-Revealing QR Factorizations and the Singular Value Decomposition. Math. Comp., Vol. 58 (1992), 213--232.","journal-title":"Math. Comp."},{"key":"e_1_3_2_2_23_1","volume-title":"Machine Learning Conf.","volume":"1","author":"Kamiran Faisal","year":"2010","unstructured":"Faisal Kamiran and Toon Calders. 2010. Classification with no discrimination by preferential sampling. In Machine Learning Conf., Vol. 1. Citeseer."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_24_1","DOI":"10.1007\/s10115-011-0463-8"},{"volume-title":"AEA papers and proceedings","author":"Kleinberg Jon","unstructured":"Jon Kleinberg, Jens Ludwig, Sendhil Mullainathan, and Ashesh Rambachan. 2018. Algorithmic fairness. In AEA papers and proceedings, Vol. 108. 22--27.","key":"e_1_3_2_2_25_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_26_1","DOI":"10.1038\/44565"},{"key":"e_1_3_2_2_27_1","volume-title":"Advances in Neural Information Processing Systems","author":"Lipton Zachary","year":"2018","unstructured":"Zachary Lipton, Julian McAuley, and Alexandra Chouldechova. 2018. Does mitigating MLtextquotesingle s impact disparity require treatment disparity?. In Advances in Neural Information Processing Systems, S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, and R. Garnett (Eds.), Vol. 31. Curran Associates, Inc. https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2018\/file\/8e0384779e58ce2af40eb365b318cc32-Paper.pdf"},{"unstructured":"Antonis Matakos Suhas Thejaswi and Bruno Ordozgoiti. 2023. Fair column subset selection -- source code v-1.1. https:\/\/github.com\/matakos18\/FairCSS\/.","key":"e_1_3_2_2_28_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_29_1","DOI":"10.1146\/annurev-statistics-042720-125902"},{"volume-title":"Convex Formulations for Fair Principal Component Analysis","author":"Olfat Matt","unstructured":"Matt Olfat and Anil Aswani. 2019. Convex Formulations for Fair Principal Component Analysis. In AAAI. AAAI Press, 663--670.","key":"e_1_3_2_2_30_1"},{"doi-asserted-by":"crossref","unstructured":"Dimitris S. Papailiopoulos Anastasios Kyrillidis and Christos Boutsidis. 2014. Provable deterministic leverage score sampling. In KDD. ACM 997--1006.","key":"e_1_3_2_2_31_1","DOI":"10.1145\/2623330.2623698"},{"key":"e_1_3_2_2_32_1","volume-title":"On lines and planes of closest fit to systems of points in space. The London, Edinburgh, and Dublin philosophical magazine and journal of science","author":"Pearson Karl","year":"1901","unstructured":"Karl Pearson. 1901. LIII. On lines and planes of closest fit to systems of points in space. The London, Edinburgh, and Dublin philosophical magazine and journal of science, Vol. 2, 11 (1901), 559--572."},{"doi-asserted-by":"crossref","unstructured":"Dino Pedreschi Salvatore Ruggieri and Franco Turini. 2008. Discrimination-aware data mining. In KDD. ACM 560--568.","key":"e_1_3_2_2_33_1","DOI":"10.1145\/1401890.1401959"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_34_1","DOI":"10.1145\/3494672"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_35_1","DOI":"10.1145\/3571151"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_36_1","DOI":"10.1257\/pandp.20201036"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_37_1","DOI":"10.1145\/3529751"},{"volume-title":"NeuRIPS (NIPS'18)","author":"Samadi Samira","unstructured":"Samira Samadi, Uthaipon Tantipongpipat, Jamie Morgenstern, Mohit Singh, and Santosh Vempala. 2018. The Price of Fair PCA: One Extra Dimension. In NeuRIPS (NIPS'18). Curran Associates Inc., 10999--11010.","key":"e_1_3_2_2_38_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_39_1","DOI":"10.1016\/j.laa.2020.09.015"},{"volume-title":"Multi-Criteria Dimensionality Reduction with Applications to Fairness","author":"Tantipongpipat Uthaipon","unstructured":"Uthaipon (Tao) Tantipongpipat, Samira Samadi, Mohit Singh, Jamie Morgenstern, and Santosh Vempala. 2019. Multi-Criteria Dimensionality Reduction with Applications to Fairness. In NIPS. Curran Associates Inc., Red Hook, NY, USA, Article 1358, 11 pages.","key":"e_1_3_2_2_40_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_41_1","DOI":"10.1145\/3322640.3326705"},{"key":"e_1_3_2_2_42_1","volume-title":"Manuel Gomez Rogriguez, and Krishna P Gummadi","author":"Zafar Muhammad Bilal","year":"2017","unstructured":"Muhammad Bilal Zafar, Isabel Valera, Manuel Gomez Rogriguez, and Krishna P Gummadi. 2017. Fairness constraints: Mechanisms for fair classification. In Artificial intelligence and statistics. PMLR, 962--970."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_43_1","DOI":"10.1145\/3132847.3132938"},{"unstructured":"Rich Zemel Yu Wu Kevin Swersky Toni Pitassi and Cynthia Dwork. 2013. Learning fair representations. In ICML. PMLR 325--333.","key":"e_1_3_2_2_44_1"}],"event":{"sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"acronym":"KDD '24","name":"KDD '24: The 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Barcelona Spain"},"container-title":["Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637528.3672005","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3637528.3672005","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T17:46:18Z","timestamp":1755798378000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637528.3672005"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,24]]},"references-count":44,"alternative-id":["10.1145\/3637528.3672005","10.1145\/3637528"],"URL":"https:\/\/doi.org\/10.1145\/3637528.3672005","relation":{},"subject":[],"published":{"date-parts":[[2024,8,24]]},"assertion":[{"value":"2024-08-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}