Fair Algorithms for Hierarchical Agglomerative Clustering

P. J. Rousseeuw, “Silhouettes: A graphical aid to the interpretation and validation of cluster analysis,” Journal of Computational and Applied Mathematics , vol. 20, pp. 53–65, 1987

1987

Earlier work this paper cites.

R. Kohavi, “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 , 1996, p. 202–207

1996

Earlier work this paper cites.

A. K.-B. Merialdo, “Clustering for collaborative filtering applications,” Intelligent Image Processing, Data Analysis & Information Retrieval , vol. 3, p. 199, 1999

1999

Earlier work this paper cites.

K. S. Pollard and M. J. Van Der Laan, “Cluster analysis of genomic data,” in Bioinformatics and Computational Biology Solutions Using R and Bioconductor . Springer, 2005, pp. 209–228

2005

Earlier work this paper cites.

I.-C. Yeh and C.-h. Lien, “The comparisons of data mining techniques for the predictive accuracy of probability of default of credit card clients,” Expert Systems with Applications , vol. 36, no. 2, 2009

2009

Earlier work this paper cites.

S. Moro, P. Cortez, and P. Rita, “A data-driven approach to predict the success of bank telemarketing,” Decision Support Systems , vol. 62, pp. 22–31, 2014

2014

Earlier work this paper cites.

M. Feldman, S. A. Friedler, J. Moeller, C. Scheidegger, and S. Venkatasubramanian, “Certifying and removing disparate impact,” in proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining , 2015, pp. 259–268

2015

Earlier work this paper cites.

S. Dasgupta, “A cost function for similarity-based hierarchical clustering,” in Proceedings of the forty-eighth annual ACM symposium on Theory of Computing , 2016, pp. 118–127

2016

Earlier work this paper cites.

I. A. Pagnuco, J. I. Pastore, G. Abras, M. Brun, and V. L. Ballarin, “Analysis of genetic association using hierarchical clustering and cluster validation indices,” Genomics , vol. 109, no. 5-6, pp. 438–445, 2017

2017

Earlier work this paper cites.

G. Duwe and K. Kim, “Out with the old and in with the new? an empirical comparison of supervised learning algorithms to predict recidivism,” Criminal Justice Policy Review , vol. 28, no. 6, 2017

2017

Cited alongside, same era.

F. Chierichetti, R. Kumar, S. Lattanzi, and S. Vassilvitskii, “Fair clustering through fairlets,” in NeurIPS , 2017, pp. 5029–5037

2017

Cited alongside, same era.

B. Moseley and J. Wang, “Approximation bounds for hierarchical clustering: Average linkage, bisecting k-means, and local search,” in NeurIPS , 2017, pp. 3094–3103

2017

Cited alongside, same era.

I. O. Bercea, M. Groß, S. Khuller, A. Kumar, C. Rösner, D. R. Schmidt, and M. Schmidt, “On the cost of essentially fair clusterings,” arXiv preprint arXiv:1811.10319 , 2018

Original

2018

Cited alongside, same era.

A. Anagnostopoulos, L. Becchetti, M. Böhm, A. Fazzone, S. Leonardi, C. Menghini, and C. Schwiegelshohn, “Principal fairness: \ ⁣ \ \backslash\backslash removing bias via projections,” arXiv preprint arXiv:1905.13651 , 2019

Original

2019

Later among the works it cites.

S. Bera, D. Chakrabarty, N. Flores, and M. Negahbani, “Fair algorithms for clustering,” NeurIPS , vol. 32, 2019

2019

Later among the works it cites.

V. Cohen-Addad, V. Kanade, F. Mallmann-Trenn, and C. Mathieu, “Hierarchical clustering: Objective functions and algorithms,” Journal of the ACM (JACM) , vol. 66, no. 4, pp. 1–42, 2019

2019

Later among the works it cites.

S. Ahmadian, A. Epasto, M. Knittel, R. Kumar, M. Mahdian, B. Moseley, P. Pham, S. Vassilvitskii, and Y. Wang, “Fair hierarchical clustering,” NeurIPS , vol. 33, pp. 21 050–21 060, 2020

2020

Closest in time.

P. Deepak, “Whither fair clustering,” in AI for Social Good Workshop. Harvard CRCS , 2020