We study the problem of finding low-cost Fair Clusterings in data where each data point may belong to many protected groups.
Reading the bibliography…
Supreme Court of the United States. Griggs v. Duke Power Co. 401 U.S. 424, March 8 1971
1971
Earlier work this paper cites.
Uniform guidelines on employee selection procedures, March 2 1979
The U.S. EEOC · 1979
Earlier work this paper cites.
Easy and hard bottleneck location problems
Wen-Lian Hsu and George L Nemhauser · 1979
Earlier work this paper cites.
Clustering to Minimize the Maximum Intercluster Distance
Teofilo F. Gonzalez · 1985
Earlier work this paper cites.
A best possible heuristic for the k k -center problem
Dorit S. Hochbaum and David B. Shmoys · 1985
Earlier work this paper cites.
An approximation algorithm for the generalized assignment problem
David B. Shmoys and Éva Tardos · 1993
Earlier work this paper cites.
Scaling up the accuracy of naive-bayes classifiers: A decision-tree hybrid
Ron Kohavi · 1996
Earlier work this paper cites.
Improved combinatorial algorithms for the facility location and k k -median problems
Moses Charikar and Sudipto Guha · 1999
Earlier work this paper cites.
The capacitated k-center problem
Samir Khuller and Yoram J Sussmann · 2000
Earlier work this paper cites.
Approximation algorithms for metric facility location and k k -median problems using the primal-dual schema and lagrangian relaxation
Kamal Jain and Vijay V. Vazirani · 2001
Earlier work this paper cites.
A constant-factor approximation algorithm for the k k -median problem
Moses Charikar, Sudipto Guha, Éva Tardos, and David B. Shmoys · 2002
Earlier work this paper cites.
The learning-curve sampling method applied to model-based clustering
Christopher Meek, Bo Thiesson, and David Heckerman · 2002
Earlier work this paper cites.
Evaluating consumer loans using neural networks
Rashmi Malhotra and Davinder K Malhotra · 2003
Earlier work this paper cites.
Local search heuristics for k-median and facility location problems
Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, and Vinayaka Pandit · 2004
Earlier work this paper cites.
Applied Psychology in Human Resource Management (6th Edition)
Herman Aguinis and Wayne F. Cascio · 2005
Earlier work this paper cites.
Achieving anonymity via clustering
Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Samir Khuller, Rina Panigrahy, Dilys Thomas, and An Zhu · 2006
Earlier work this paper cites.
K-means++: The advantages of careful seeding
David Arthur and Sergei Vassilvitskii · 2007
Earlier work this paper cites.
Simpler analyses of local search algorithms for facility location
Anupam Gupta and Kanat Tangwongsan · 2008
Earlier work this paper cites.
The comparisons of data mining techniques for the predictive accuracy of probability of default of credit card clients
Che-hui Lien I-Cheng Yeh · 2009
Earlier work this paper cites.
Three naive bayes approaches for discrimination-free classification
Toon Calders and Sicco Verwer · 2010
Earlier work this paper cites.
Consumer credit-risk models via machine-learning algorithms
Amir E Khandani, Adlar J Kim, and Andrew W Lo · 2010
Earlier work this paper cites.
Lower-bounded facility location
Zoya Svitkina · 2010
Earlier work this paper cites.
k-nn as an implementation of situation testing for discrimination discovery and prevention
Binh Thanh Luong, Salvatore Ruggieri, and Franco Turini · 2011
Earlier work this paper cites.
Scikit-learn: Machine learning in Python
F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V. Dubourg, J. Vanderplas, A. Passos, D. Cournapeau, M. Brucher, M. Perrot, and E. Duchesnay · 2011
Cited alongside, same era.
Improved approximation guarantees for lower-bounded facility location
Sara Ahmadian and Chaitanya Swamy · 2012
Cited alongside, same era.
Fairness through awareness
Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, and Richard Zemel · 2012
Cited alongside, same era.
Fairness-aware classifier with prejudice remover regularizer
Toshihiro Kamishima, Shotaro Akaho, Hideki Asoh, and Jun Sakuma · 2012
Cited alongside, same era.
Degree bounded matroids and submodular flows
Tamás Király, Lap Chi Lau, and Mohit Singh · 2012
Cited alongside, same era.
Data clustering: algorithms and applications
Charu C Aggarwal and Chandan K Reddy · 2013
Cited alongside, same era.
Learning fair representations
Rich Zemel, Yu Wu, Kevin Swersky, Toni Pitassi, and Cynthia Dwork · 2013
Cited alongside, same era.
An improved approximation for k k -median, and positive correlation in budgeted optimization
Jarosław Byrka, Thomas Pensyl, Bartosz Rybicki, Aravind Srinivasan, and Khoa Trinh · 2014
Cited alongside, same era.
Machine learning for targeted display advertising: Transfer learning in action
Claudia Perlich, Brian Dalessandro, Troy Raeder, Ori Stitelman, and Foster Provost · 2014
Cited alongside, same era.
A data-driven approach to predict the success of bank telemarketing
Paulo Rita Sérgio Moro, Paulo Cortez · 2014
Cited alongside, same era.
A unified framework for clustering constrained data without locality property
Hu Ding and Jinhui Xu · 2015
Cited alongside, same era.
Certifying and removing disparate impact
Michael Feldman, Sorelle A Friedler, John Moeller, Carlos Scheidegger, and Suresh Venkatasubramanian · 2015
Cited alongside, same era.
Inherent trade-offs in the fair determination of risk scores
Jon M. Kleinberg, Sendhil Mullainathan, and Manish Raghavan · 2017
Later among the works it cites.
Measuring fairness in ranked outputs
Ke Yang and Julia Stoyanovich · 2017
Later among the works it cites.
Fairness constraints: Mechanisms for fair classification
Muhammad Bilal Zafar, Isabel Valera, Manuel Gomez-Rodriguez, and Krishna P. Gummadi · 2017
Later among the works it cites.
Constant factor FPT approximation for capacitated k-median
Marek Adamczyk, Jaroslaw Byrka, Jan Marcinkowski, Syed M. Meesum, and Michal Wlodarczyk · 2018
Later among the works it cites.
On the cost of essentially fair clusterings
Ioana O. Bercea, Martin Groß, Samir Khuller, Aounon Kumar, Clemens Rösner, Daniel R. Schmidt, and Melanie Schmidt · 2018
Later among the works it cites.
Faster algorithms for the constrained k-means problem
Anup Bhattacharya, Ragesh Jaiswal, and Amit Kumar · 2018
Later among the works it cites.
Multiwinner voting with fairness constraints
L Elisa Celis, Lingxiao Huang, and Nisheeth K Vishnoi · 2018
Later among the works it cites.
Ranking with Fairness Constraints
L. Elisa Celis, Damian Straszak, and Nisheeth K. Vishnoi · 2018
Later among the works it cites.
Generalized Center Problems with Outliers
Deeparnab Chakrabarty and Maryam Negahbani · 2018
Later among the works it cites.
Putting machine learning into the hands of every advertiser
Jerry Dischler · 2018
Later among the works it cites.
The accuracy, fairness, and limits of predicting recidivism
Julia Dressel and Hany Farid · 2018
Later among the works it cites.
Privacy Preserving Clustering with Constraints
Clemens Rösner and Melanie Schmidt · 2018
Later among the works it cites.
Fair coresets and streaming algorithms for fair k-means clustering
Melanie Schmidt, Chris Schwiegelshohn, and Christian Sohler · 2018
Later among the works it cites.
Clustering without over-representation
Sara Ahmadian, Alessandro Epasto, Ravi Kumar, and Mohammad Mahdian · 2019
Closest in time.
Scalable fair clustering
Krzysztof Onak Baruch Schieber Ali Vakilian Arturs Backurs, Piotr Indyk and Tal Wagner · 2019
Closest in time.
Classification with fairness constraints: A meta-algorithm with provable guarantees
L. Elisa Celis, Lingxiao Huang, Vijay Keswani, and Nisheeth K. Vishnoi · 2019
Closest in time.
Proportionally fair clustering
Xingyu Chen, Brandon Fain, Charles Lyu, and Kamesh Munagala · 2019
Closest in time.
Matroids, matchings, and fairness
Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, and Sergei Vassilvtiskii · 2019
Closest in time.
Tight fpt approximations for k k -median and k k -means
Vincent Cohen-Addad, Anupam Gupta, Amit Kumar, Euiwoong Lee, and Jason Li · 2019
Closest in time.
Ibm ilog cplex 12.9
IBM · 2019
Closest in time.
Fair k-center clustering for data summarization
Matthäus Kleindessner, Pranjal Awasthi, and Jamie Morgenstern · 2019
Closest in time.
Guarantees for spectral clustering with fairness constraints
Matthäus Kleindessner, Samira Samadi, Pranjal Awasthi, and Jamie Morgenstern · 2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…