{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T01:34:17Z","timestamp":1768354457849,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,14]],"date-time":"2022-08-14T00:00:00Z","timestamp":1660435200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NSF CIF program","award":["19566384"],"award-info":[{"award-number":["19566384"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,8,14]]},"DOI":"10.1145\/3534678.3539378","type":"proceedings-article","created":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T19:06:12Z","timestamp":1660331172000},"page":"201-211","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["HyperAid"],"prefix":"10.1145","author":[{"given":"Eli","family":"Chien","sequence":"first","affiliation":[{"name":"University of Illinois Urbana-Champaign, Urbana, IL, USA"}]},{"given":"Puoya","family":"Tabaghi","sequence":"additional","affiliation":[{"name":"University of Illinois Urbana-Champaign, Urbana, IL, USA"}]},{"given":"Olgica","family":"Milenkovic","sequence":"additional","affiliation":[{"name":"University of Illinois Urbana-Champaign, Urbana, IL, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,8,14]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281110"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795296334"},{"key":"e_1_3_2_2_3_1","volume-title":"Bisect and conquer: Hierarchical clustering via max-uncut bisection. arXiv preprint arXiv:1912.06983","author":"Ahmadian Sara","year":"2019","unstructured":"Sara Ahmadian, Vaggos Chatziafratis, Alessandro Epasto, Euiwoong Lee, Mohammad Mahdian, Konstantin Makarychev, and Grigory Yaroslavtsev. 2019. Bisect and conquer: Hierarchical clustering via max-uncut bisection. arXiv preprint arXiv:1912.06983 (2019)."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.36"},{"key":"e_1_3_2_2_5_1","volume-title":"Conference on Learning Theory. PMLR, 153--162","author":"Alon Noga","year":"2020","unstructured":"Noga Alon, Yossi Azar, and Danny Vainstein. 2020. Hierarchical clustering: a 0.585 revenue approximation. In Conference on Learning Theory. PMLR, 153--162."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0045077"},{"key":"e_1_3_2_2_7_1","volume-title":"Alpha Boubacar Diallo, and Vladimir Makarenkov","author":"Boc Alix","year":"2012","unstructured":"Alix Boc, Alpha Boubacar Diallo, and Vladimir Makarenkov. 2012. T-REX: a web server for inferring, validating and visualizing phylogenetic trees and networks. Nucleic acids research 40, W1 (2012), W573--W579."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2254619"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(74)90047-1"},{"key":"e_1_3_2_2_10_1","volume-title":"From trees to continuous embeddings and back: Hyperbolic hierarchical clustering. arXiv preprint arXiv:2010.00402","author":"Chami Ines","year":"2020","unstructured":"Ines Chami, Albert Gu, Vaggos Chatziafratis, and Christopher R\u00e9. 2020. From trees to continuous embeddings and back: Hyperbolic hierarchical clustering. arXiv preprint arXiv:2010.00402 (2020)."},{"key":"e_1_3_2_2_11_1","unstructured":"Ines Chami Zhitao Ying Christopher R\u00e9 and Jure Leskovec. 2019. Hyperbolic graph convolutional neural networks. In Advances in Neural Information Processing Systems. 4868--4879."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/3039686.3039739"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.139"},{"key":"e_1_3_2_2_14_1","volume-title":"Highly Scalable and Provably Accurate Classification in Poincar\u00e9 Balls. In 2021 IEEE International Conference on Data Mining (ICDM). IEEE, 61--70","author":"Chien Eli","year":"2021","unstructured":"Eli Chien, Chao Pan, Puoya Tabaghi, and Olgica Milenkovic. 2021. Highly Scalable and Provably Accurate Classification in Poincar\u00e9 Balls. In 2021 IEEE International Conference on Data Mining (ICDM). IEEE, 61--70."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/abc62d"},{"key":"e_1_3_2_2_16_1","volume-title":"International Conference on Artificial Intelligence and Statistics. PMLR","author":"Cho Hyunghoon","year":"2019","unstructured":"Hyunghoon Cho, Benjamin DeMeo, Jian Peng, and Bonnie Berger. 2019. Largemargin classification in hyperbolic space. In International Conference on Artificial Intelligence and Statistics. PMLR, 1832--1840."},{"key":"e_1_3_2_2_17_1","volume-title":"Visualizing and measuring the geometry of BERT. arXiv preprint arXiv:1906.02715","author":"Coenen Andy","year":"2019","unstructured":"Andy Coenen, Emily Reif, Ann Yuan, Been Kim, Adam Pearce, Fernanda Vi\u00e9gas, and Martin Wattenberg. 2019. Visualizing and measuring the geometry of BERT. arXiv preprint arXiv:1906.02715 (2019)."},{"key":"e_1_3_2_2_18_1","volume-title":"Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. arXiv preprint arXiv:2110.02807","author":"Cohen-Addad Vincent","year":"2021","unstructured":"Vincent Cohen-Addad, Debarati Das, Evangelos Kipouridis, Nikos Parotsidis, and Mikkel Thorup. 2021. Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. arXiv preprint arXiv:2110.02807 (2021)."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897527"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0001-8708(84)90029-X"},{"key":"e_1_3_2_2_21_1","unstructured":"Dheeru Dua and Casey Graff. 2017. UCI Machine Learning Repository. http: \/\/archive.ics.uci.edu\/ml"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01188585"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"Octavian Ganea Gary B\u00e9cigneul and Thomas Hofmann. 2018. Hyperbolic neural networks. In Advances in Neural Information Processing Systems. 5345--5355.","DOI":"10.1109\/TNNLS.2018.2798162"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"crossref","unstructured":"Olivier Gascuel et al. 1997. Concerning the NJ algorithm and its unweighted version UNJ. (1997).","DOI":"10.1090\/dimacs\/037\/09"},{"key":"e_1_3_2_2_25_1","volume-title":"Essays in group theory","author":"Gromov Mikhael","unstructured":"Mikhael Gromov. 1987. Hyperbolic groups. In Essays in group theory. Springer, 75--263."},{"key":"e_1_3_2_2_26_1","volume-title":"Approximating the best-fit tree under l","author":"Harb Boulos","unstructured":"Boulos Harb, Sampath Kannan, and Andrew McGregor. 2005. Approximating the best-fit tree under l p norms. In Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques. Springer, 123--133."},{"key":"e_1_3_2_2_27_1","volume-title":"An empirical test of the midpoint rooting method. Biological Journal of the Linnean society 92, 4","author":"Hess Pablo N","year":"2007","unstructured":"Pablo N Hess and Claudia A De Moraes Russo. 2007. An empirical test of the midpoint rooting method. Biological Journal of the Linnean society 92, 4 (2007), 669--674."},{"key":"e_1_3_2_2_28_1","volume-title":"Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies","volume":"1","author":"Hewitt John","year":"2019","unstructured":"John Hewitt and Christopher D Manning. 2019. A structural probe for finding syntax in word representations. In Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers). 4129--4138."},{"key":"e_1_3_2_2_29_1","volume-title":"Geoopt: Riemannian Optimization in PyTorch. arXiv:2005.02819 [cs.CG]","author":"Kochurov Max","year":"2020","unstructured":"Max Kochurov, Rasul Karimov, and Serge Kozlukov. 2020. Geoopt: Riemannian Optimization in PyTorch. arXiv:2005.02819 [cs.CG]"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.82.036106"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200757"},{"key":"e_1_3_2_2_32_1","unstructured":"Qi Liu Maximilian Nickel and Douwe Kiela. 2019. Hyperbolic graph neural networks. In Advances in Neural Information Processing Systems. 8230--8241."},{"key":"e_1_3_2_2_33_1","volume-title":"Cluster Trellis: Data Structures & Algorithms for Exact Inference in Hierarchical Clustering. In International Conference on Artificial Intelligence and Statistics. PMLR, 2467--2475","author":"Macaluso Sebastian","year":"2021","unstructured":"Sebastian Macaluso, Craig Greenberg, Nicholas Monath, Ji Ah Lee, Patrick Flaherty, Kyle Cranmer, Andrew McGregor, and Andrew McCallum. 2021. Cluster Trellis: Data Structures & Algorithms for Exact Inference in Hierarchical Clustering. In International Conference on Artificial Intelligence and Statistics. PMLR, 2467--2475."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330997"},{"key":"e_1_3_2_2_35_1","volume-title":"Proceedings of the 31st International Conference on Neural Information Processing Systems.","author":"Moseley Benjamin","year":"2017","unstructured":"Benjamin Moseley and Joshua R Wang. 2017. Approximation bounds for hierarchical clustering: Average linkage, bisecting k-means, and local search. In Proceedings of the 31st International Conference on Neural Information Processing Systems."},{"key":"e_1_3_2_2_36_1","first-page":"101","article-title":"Complexities of hierarchic clustering algorithms: state of the art","volume":"1","author":"Murtagh Fionn","year":"1984","unstructured":"Fionn Murtagh. 1984. Complexities of hierarchic clustering algorithms: state of the art. Computational Statistics Quarterly 1, 2 (1984), 101--113.","journal-title":"Computational Statistics Quarterly"},{"key":"e_1_3_2_2_37_1","volume-title":"Poincar\u00e9 embeddings for learning hierarchical representations. Advances in neural information processing systems 30","author":"Nickel Maximillian","year":"2017","unstructured":"Maximillian Nickel and Douwe Kiela. 2017. Poincar\u00e9 embeddings for learning hierarchical representations. Advances in neural information processing systems 30 (2017), 6338--6347."},{"key":"e_1_3_2_2_38_1","volume-title":"International Conference on Machine Learning. PMLR, 3779--3788","author":"Nickel Maximillian","year":"2018","unstructured":"Maximillian Nickel and Douwe Kiela. 2018. Learning continuous hierarchies in the lorentz model of hyperbolic geometry. In International Conference on Machine Learning. PMLR, 3779--3788."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.92.022807"},{"key":"e_1_3_2_2_40_1","volume-title":"Differential Geometry for Machine Learning Workshop at NeurIPS.","author":"Sahoo Roshni","year":"2020","unstructured":"Roshni Sahoo, Ines Chami, and Christopher R\u00e9. 2020. Tree Covers: An Alternative to Metric Embeddings. In Differential Geometry for Machine Learning Workshop at NeurIPS."},{"key":"e_1_3_2_2_41_1","volume-title":"The neighbor-joining method: a new method for reconstructing phylogenetic trees. Molecular biology and evolution 4, 4","author":"Saitou Naruya","year":"1987","unstructured":"Naruya Saitou and Masatoshi Nei. 1987. The neighbor-joining method: a new method for reconstructing phylogenetic trees. Molecular biology and evolution 4, 4 (1987), 406--425."},{"key":"e_1_3_2_2_42_1","volume-title":"International Conference on Machine Learning","volume":"80","author":"Sala Frederic","year":"2018","unstructured":"Frederic Sala, Chris De Sa, Albert Gu, and Christopher Re. 2018. Representation tradeoffs for hyperbolic embeddings. In International Conference on Machine Learning, Vol. 80. PMLR, 4460--4469."},{"key":"e_1_3_2_2_43_1","volume-title":"International Symposium on Graph Drawing. Springer, 355--366","author":"Sarkar Rik","year":"2011","unstructured":"Rik Sarkar. 2011. Low distortion delaunay embedding of trees in hyperbolic plane. In International Symposium on Graph Drawing. Springer, 355--366."},{"key":"e_1_3_2_2_44_1","volume-title":"International Conference on Learning Representations. https: \/\/openreview.net\/forum?id=Ec85b0tUwbA","author":"Shimizu Ryohei","year":"2021","unstructured":"Ryohei Shimizu, YUSUKE Mukuta, and Tatsuya Harada. 2021. Hyperbolic Neural Networks++. In International Conference on Learning Representations. https: \/\/openreview.net\/forum?id=Ec85b0tUwbA"},{"key":"e_1_3_2_2_45_1","volume-title":"arXiv preprint arXiv:2005.03847","author":"Sonthalia Rishi","year":"2020","unstructured":"Rishi Sonthalia and Anna C Gilbert. 2020. Tree! i am no tree! i am a low dimensional hyperbolic embedding. arXiv preprint arXiv:2005.03847 (2020)."},{"key":"e_1_3_2_2_46_1","volume-title":"Linear Classifiers in Product Space Forms. arXiv preprint arXiv:2102.10204","author":"Tabaghi Puoya","year":"2021","unstructured":"Puoya Tabaghi, Eli Chien, Chao Pan, Jianhao Peng, and Olgica Milenkovic. 2021. Linear Classifiers in Product Space Forms. arXiv preprint arXiv:2102.10204 (2021)."},{"key":"e_1_3_2_2_47_1","volume-title":"International Conference on Learning Representations. https:\/\/openreview.net\/forum?id=Ske5r3AqK7","author":"Tifrea Alexandru","year":"2019","unstructured":"Alexandru Tifrea, Gary Becigneul, and Octavian-Eugen Ganea. 2019. Poincar\u00e9 GloVe: hyperbolic word embeddings. In International Conference on Learning Representations. https:\/\/openreview.net\/forum?id=Ske5r3AqK7"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"crossref","unstructured":"Abraham A Ungar. 2008. Analytic hyperbolic geometry and Albert Einstein's special theory of relativity. World Scientific.","DOI":"10.1142\/9789812772305"},{"key":"e_1_3_2_2_49_1","volume-title":"Expositiones Mathematicae 23","author":"V\u00e4is\u00e4l\u00e4 Jussi","year":"2005","unstructured":"Jussi V\u00e4is\u00e4l\u00e4. 2005. Gromov hyperbolic spaces. Expositiones Mathematicae 23, 3 (2005), 187--231.[50] J Vermeer. 2005. A geometric interpretation of Ungar's addition and of gyration in the hyperbolic plane. Topology and its Applications 152, 3 (2005), 226--242."},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-5193(77)90351-4"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04241-6_31"},{"key":"e_1_3_2_2_53_1","volume-title":"Numerically accurate hyperbolic embeddings using tiling-based models. Advances in Neural Information Processing Systems 32","author":"Yu Tao","year":"2019","unstructured":"Tao Yu and Christopher M De Sa. 2019. Numerically accurate hyperbolic embeddings using tiling-based models. Advances in Neural Information Processing Systems 32 (2019)."},{"key":"e_1_3_2_2_54_1","unstructured":"Tao Yu and Christopher M De Sa. 2021. Representing Hyperbolic Space Accurately using Multi-Component Floats. Advances in Neural Information Processing Systems 34 (2021)"}],"event":{"name":"KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Washington DC USA","acronym":"KDD '22","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3534678.3539378","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3534678.3539378","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:47Z","timestamp":1750186967000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3534678.3539378"}},"subtitle":["Denoising in Hyperbolic Spaces for Tree-fitting and Hierarchical Clustering"],"short-title":[],"issued":{"date-parts":[[2022,8,14]]},"references-count":53,"alternative-id":["10.1145\/3534678.3539378","10.1145\/3534678"],"URL":"https:\/\/doi.org\/10.1145\/3534678.3539378","relation":{},"subject":[],"published":{"date-parts":[[2022,8,14]]},"assertion":[{"value":"2022-08-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}