Fetching the paper…
Reading the bibliography…
In the application of data clustering to human-centric decision-making systems, such as loan applications and advertisement recommendations, the clustering outcome might discriminate against people across different demographic groups, leading to unfairness.
Gass, S., Saaty, T.: The computational algorithm for the parametric objective function. Nav. Res. Logist. Q. 2
1955
Earlier work this paper cites.
Lloyd, S.: Least squares quantization in PCM. IEEE transactions on information theory 28
1982
Earlier work this paper cites.
Selim, S.Z., Ismail, M.A.: k k -means-type algorithms: A generalized convergence theorem and characterization of local optimality. IEEE Transactions on pattern analysis and machine intelligence pp. 81–87 (1984)
1984
Earlier work this paper cites.
Bottou, L., Bengio, Y.: Convergence properties of the k k -means algorithms. In: Advances in neural information processing systems. pp. 585–592 (1995)
1995
Earlier work this paper cites.
Kohavi, R.: Scaling up the accuracy of naive-bayes classifiers: A decision-tree hybrid. In: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining. p. 202–207. KDD’96, AAAI Press (1996)
1996
Earlier work this paper cites.
Kanungo, T., Mount, D.M., Netanyahu, N.S., Piatko, C.D., Silverman, R., Wu, A.Y.: A local search approximation algorithm for k k -means clustering. Computational Geometry 28
2004
Earlier work this paper cites.
Berkhin, P.: A survey of clustering data mining techniques. In: Grouping multidimensional data, pp. 25–71. Springer (2006)
2006
Earlier work this paper cites.
Arthur, D., Vassilvitskii, S.: k k -means++ the advantages of careful seeding. In: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms. pp. 1027–1035 (2007)
2007
Earlier work this paper cites.
Calders, T., Kamiran, F., Pechenizkiy, M.: Building classifiers with independency constraints. In: 2009 IEEE International Conference on Data Mining Workshops. pp. 13–18. IEEE (2009)
2009
Earlier work this paper cites.
Dwork, C., Hardt, M., Pitassi, T., Reingold, O., Zemel, R.: Fairness through awareness. In: Proceedings of the 3rd innovations in theoretical computer science conference. pp. 214–226. ACM (2012)
2012
Earlier work this paper cites.
Moro, S., Cortez, P., Rita, P.: A data-driven approach to predict the success of bank telemarketing. Decision Support Systems 62
2014
Earlier work this paper cites.
Datta, A., Tschantz, M.C., Datta, A.: Automated experiments on ad privacy settings: A tale of opacity, choice, and discrimination. Proceedings on privacy enhancing technologies 2015
2015
Cited alongside, same era.
Barocas, S., Selbst, A.D.: Big data’s disparate impact. California Law Review p. 671 (2016)
2016
Cited alongside, same era.
Hardt, M., Price, E., Srebro, N.: Equality of opportunity in supervised learning. In: Advances in neural information processing systems. pp. 3315–3323 (2016)
2016
Cited alongside, same era.
Chierichetti, F., Kuma, R., Lattanzi, S., Vassilvitskii, S.: Fair clustering through fairlets. In: Advances in Neural Information Processing Systems. pp. 5029–5037 (2017)
2017
Cited alongside, same era.
Dua, D., Graff, C.: UCI Machine Learning Repository (2017), http://archive.ics.uci.edu/ml
2017
Cited alongside, same era.
Huang, L., Jiang, S., Vishnoi, N.: Coresets for clustering with fairness constraints. In: Advances in Neural Information Processing Systems. pp. 7589–7600 (2019)
2019
Later among the works it cites.
Kleindessner, M., Awasthi, P., Morgenstern, J.: Fair k k -center clustering for data summarization. In: International Conference on Machine Learning. pp. 3448–3457. PMLR (2019)
2019
Later among the works it cites.
Kleindessner, M., Samadi, S., Awasthi, P., Morgenstern, J.: Guarantees for spectral clustering with fairness constraints. In: International Conference on Machine Learning. pp. 3458–3467. PMLR (2019)
2019
Later among the works it cites.
Schmidt, M., Schwiegelshohn, C., Sohler, C.: Fair coresets and streaming algorithms for fair k k -means. In: International Workshop on Approximation and Online Algorithms. pp. 232–251. Springer (2019)
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Rösner, C., Schmidt, M.: Privacy preserving clustering with constraints. In: 45th International Colloquium on Automata, Languages, and Programming. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)
2018
Cited alongside, same era.
2019
Cited alongside, same era.
Ahmadian, S., Epasto, A., Kumar, R., Mahdian, M.: Clustering without over-representation. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. pp. 267–275 (2019)
2019
Cited alongside, same era.
Backurs, A., Indyk, P., Onak, K., Schieber, B., Vakilian, A., Wagner, T.: Scalable fair clustering. In: International Conference on Machine Learning. pp. 405–413. PMLR (2019)
2019
Cited alongside, same era.
Bera, S., Chakrabarty, D., Flores, N., Negahbani, M.: Fair algorithms for clustering. In: Advances in Neural Information Processing Systems. pp. 4954–4965 (2019)
2019
Cited alongside, same era.
Chen, X., Fain, B., Lyu, L., Munagala, K.: Proportionally fair clustering. In: International Conference on Machine Learning. pp. 1032–1041 (2019)
2019
Cited alongside, same era.
Gan, G., Ma, C., Wu, J.: Data clustering: theory, algorithms, and applications. SIAM (2020)
2020
Later among the works it cites.
2020
Later among the works it cites.
Mahabadi, S., Vakilian, A.: Individual fairness for k k -clustering. In: Proceedings of the 37th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 119, pp. 6586–6596. PMLR, Virtual (13-18 Jul 2020)
2020
Later among the works it cites.
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–514 (2021)
2021
Closest in time.
Ghadiri, M., Samadi, S., Vempala, S.: Socially fair k k -means clustering. In: Proceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency. pp. 438–448 (2021)
2021
Closest in time.
Ziko, I.M., Granger, E., Yuan, J., Ayed, I.B.: Variational fair clustering. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 35, pp. 11202–11209 (2021)
2021
Closest in time.