[1] Amazon product reviews dataset. https://www.kaggle.com/datasets/kashnitsky/hierarchical-text-classification, . Accessed: 2023-05-16.
[2] S&P500 stock data. https://www.kaggle.com/datasets/camnugent/sandp500, . Accessed: 2023-05-16.
[3] S&P500 hierarchy. https://en.wikipedia.org/wiki/List_of_S%26P_500 Companies, . Accessed: 2023-05-16.
[4] Wikipedia list of phylogenetics software. https://en.m.wikipedia.org/wiki/List_of_phylogeneticssoftware. Accessed: 2023-05-16.
[5] Amir Abboud, Vincent Cohen-Addad, and Hussein Houdrouge. Subquadratic high-dimensional hierarchical clustering. Advances in Neural Information Processing Systems, 32, 2019.
[6] Sara Ahmadian, Alessandro Epasto, Marina Knittel, Ravi Kumar, Mohammad Mahdian, Benjamin Moseley, Philip Pham, Sergei Vassilitskii, and Yuyan Wang. Fair hierarchical clustering. Advances in Neural Information Processing Systems, 33:21050-21060, 2020.
[7] Mihael Ankerst, Markus M Breunig, Hans-Peter Kriegel, and Jörg Sander. Optics: Ordering points to identify the clustering structure. ACM Sigmoid record, 28(2):49-60, 1999.
[8] Matteo Barigozzi, Haeran Cho, and Dom Owens. Fnets: Factor-adjusted network estimation and forecasting for high-dimensional time series. arXiv preprint arXiv:2201.06110, 2022.
[9] Ricardo JGB Campello, Davoud Moulavi, and Jörg Sander. Density-based clustering based on hierarchical density estimates. In Advances in Knowledge Discovery and Data Mining: 17th Pacific-Asia Conference, PAKDD 2013, Gold Coast, Australia, April 14-17, 2013, Proceedings, Part II 17, pages 160-172. Springer, 2013.
[10] Gunnar E Carlsson, Facundo Memoli, et al. Characterization, stability and convergence of hierarchical clustering methods. J. Mach. Learn. Res., 11(Apr):1425-1470, 2010.
[11] Moses Charikar and Vaggos Chatziafratis. Approximate hierarchical clustering via sparsest cut and spreading metrics. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 841-854. SIAM, 2017.
[12] Vaggos Chatziafratis, Mohammad Mahdian, and Sara Ahmadian. Maximizing agreements for ranking, clustering and hierarchical clustering via max-cut. In International Conference on Artificial Intelligence and Statistics, pages 1657-1665. PMLR, 2021.
[13] Anshuman Chhabra and Prasant Mohapatra. Fair algorithms for hierarchical agglomerative clustering. In 2022 21st IEEE International Conference on Machine Learning and Applications (ICMLA), pages 206-211. IEEE, 2022.
[14] Vincent Cohen-Addad, Varun Kanade, and Frederik Mallmann-Trenn. Hierarchical clustering beyond the worst-case. Advances in Neural Information Processing Systems, 30, 2017.
[15] Vincent Cohen-Addad, Varun Kanade, Frederik Mallmann-Trenn, and Claire Mathieu. Hierarchical clustering: Objective functions and algorithms. Journal of the ACM (JACM), 66(4):1-42, 2019.
[16] Sanjoy Dasgupta. A cost function for similarity-based hierarchical clustering. In Proceedings of the forty-eighth annual ACM symposium on Theory of Computing, pages 118-127, 2016.
[17] William HE Day and Herbert Edelsbrunner. Efficient algorithms for agglomerative hierarchical clustering methods. Journal of classification, 1(1):7-24, 1984.
[18] Ronald W DeBry. The consistency of several phylogeny-inference methods under varying evolutionary rates. Molecular Biology and Evolution, 9(3):537-551, 1992.
[19] Roland L Dobrushin. Central limit theorem for nonstationary markov chains. i. Theory of Probability & Its Applications, 1(1):65-80, 1956.