More Like this

1. Statistical significance for hierarchical clustering: Statistical Significance for Hierarchical Clustering

   https://doi.org/10.1111/biom.12647  

   Kimes, Patrick K.; Liu, Yufeng; Neil Hayes, David; Marron, James Stephen (September 2017, Biometrics)
2. Hierarchical MultiClass AdaBoost

   https://doi.org/10.1109/BigData52589.2021.9671291  

   Chelmis, Charalampos; Qi, Wenting (December 2021, 2021 IEEE International Conference on Big Data (Big Data))
3. Fair Hierarchical Clustering

   Ahmadian, S; Epasto, A; Knittel, M; Kumar, R; Mahdian, M; Moseley, B; Pham, P; Vassilvitskii, S; Wang, Y (December 2020, Advances in neural information processing systems)

   null (Ed.)

   As machine learning has become more prevalent, researchers have begun to recognize the necessity of ensuring machine learning systems are fair. Recently, there has been an interest in defining a notion of fairness that mitigates over-representation in traditional clustering. In this paper we extend this notion to hierarchical clustering, where the goal is to recursively partition the data to optimize a specific objective. For various natural objectives, we obtain simple, efficient algorithms to find a provably good fair hierarchical clustering. Empirically, we show that our algorithms can find a fair hierarchical clustering, with only a negligible loss in the objective. 

   more » « less
4. Fair Hierarchical Clustering

   Ahmadian, Sara; Epasto, Alessandro; Knittel, Marina; Kumar, Ravi; Mahdian, Mohammad; Moseley, Benjamin; Pham, Philip; Vassilvitskii, Sergei; Wang, Yuyan (January 2020, 34th Conference on Neural Information Processing Systems)

   null (Ed.)
5. Scalable Hierarchical Agglomerative Clustering

   https://doi.org/10.1145/3447548.3467404  

   Monath, Nicholas; Dubey, Kumar Avinava; Guruganesh, Guru; Zaheer, Manzil; Ahmed, Amr; McCallum, Andrew; Mergen, Gokhan; Najork, Marc; Terzihan, Mert; Tjanaka, Bryon; et al (August 2021, KDD '21: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining)

   null (Ed.)

   The applicability of agglomerative clustering, for inferring both hierarchical and flat clustering, is limited by its scalability. Existing scalable hierarchical clustering methods sacrifice quality for speed and often lead to over-merging of clusters. In this paper, we present a scalable, agglomerative method for hierarchical clustering that does not sacrifice quality and scales to billions of data points. We perform a detailed theoretical analysis, showing that under mild separability conditions our algorithm can not only recover the optimal flat partition but also provide a two-approximation to non-parametric DP-Means objective. This introduces a novel application of hierarchical clustering as an approximation algorithm for the non-parametric clustering objective. We additionally relate our algorithm to the classic hierarchical agglomerative clustering method. We perform extensive empirical experiments in both hierarchical and flat clustering settings and show that our proposed approach achieves state-of-the-art results on publicly available clustering benchmarks. Finally, we demonstrate our method's scalability by applying it to a dataset of 30 billion queries. Human evaluation of the discovered clusters show that our method finds better quality of clusters than the current state-of-the-art. 

   more » « less