{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T04:50:43Z","timestamp":1784695843532,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":62,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,8,14]],"date-time":"2021-08-14T00:00:00Z","timestamp":1628899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1763618"],"award-info":[{"award-number":["1763618"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,8,14]]},"DOI":"10.1145\/3447548.3467404","type":"proceedings-article","created":{"date-parts":[[2021,8,12]],"date-time":"2021-08-12T06:12:03Z","timestamp":1628748723000},"page":"1245-1255","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":42,"title":["Scalable Hierarchical Agglomerative Clustering"],"prefix":"10.1145","author":[{"given":"Nicholas","family":"Monath","sequence":"first","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kumar Avinava","family":"Dubey","sequence":"additional","affiliation":[{"name":"Google LLC, Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guru","family":"Guruganesh","sequence":"additional","affiliation":[{"name":"Google LLC, Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manzil","family":"Zaheer","sequence":"additional","affiliation":[{"name":"Google LLC, Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amr","family":"Ahmed","sequence":"additional","affiliation":[{"name":"Google LLC, Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrew","family":"McCallum","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gokhan","family":"Mergen","sequence":"additional","affiliation":[{"name":"Google LLC, Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marc","family":"Najork","sequence":"additional","affiliation":[{"name":"Google LLC, Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mert","family":"Terzihan","sequence":"additional","affiliation":[{"name":"Google LLC, Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bryon","family":"Tjanaka","sequence":"additional","affiliation":[{"name":"University of Southern California, Los Angeles, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuan","family":"Wang","sequence":"additional","affiliation":[{"name":"Google LLC, Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuchen","family":"Wu","sequence":"additional","affiliation":[{"name":"Google LLC, Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,8,14]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","unstructured":"N. Andrews J. Eisner and M. Dredze. 2014. Robust entity clustering via phylogenetic inference. ACL (2014).  N. Andrews J. Eisner and M. Dredze. 2014. Robust entity clustering via phylogenetic inference. ACL (2014).","DOI":"10.3115\/v1\/P14-1073"},{"key":"e_1_3_2_2_2_1","unstructured":"D. Arthur and S. Vassilvitskii. 2007. k-means: The advantages of careful seeding. SODA (2007).  D. Arthur and S. Vassilvitskii. 2007. k-means: The advantages of careful seeding. SODA (2007)."},{"key":"e_1_3_2_2_3_1","unstructured":"O. Bachem M. Lucic and A. Krause. 2015. Coresets for Nonparametric Estimation-the Case of DP-Means. ICML (2015).  O. Bachem M. Lucic and A. Krause. 2015. Coresets for Nonparametric Estimation-the Case of DP-Means. ICML (2015)."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"M.F. Balcan A. Blum and S. Vempala. 2008. A discriminative framework for clustering via similarity functions. STOC (2008).  M.F. Balcan A. Blum and S. Vempala. 2008. A discriminative framework for clustering via similarity functions. STOC (2008).","DOI":"10.1145\/1374376.1374474"},{"key":"e_1_3_2_2_5_1","unstructured":"M.F. Balcan Y. Liang and P. Gupta. 2014. Robust hierarchical clustering. JMLR (2014).  M.F. Balcan Y. Liang and P. Gupta. 2014. Robust hierarchical clustering. JMLR (2014)."},{"key":"e_1_3_2_2_6_1","volume-title":"Affinity Clustering: Hierarchical Clustering at Scale. NeurIPS","author":"Bateni M.","year":"2017","unstructured":"M. Bateni , S. Behnezhad , M. Derakhshan , M. Hajiaghayi , R. Kiveris , S. Lattanzi , and V. Mirrokni . 2017 . Affinity Clustering: Hierarchical Clustering at Scale. NeurIPS (2017). M. Bateni, S. Behnezhad, M. Derakhshan, M. Hajiaghayi, R. Kiveris, S. Lattanzi, and V. Mirrokni. 2017. Affinity Clustering: Hierarchical Clustering at Scale. NeurIPS (2017)."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"F. Benevenuto T. Rodrigues M. Cha and V. Almeida. 2012. Characterizing user navigation and interactions in online social networks. Inf. Sci. (2012).  F. Benevenuto T. Rodrigues M. Cha and V. Almeida. 2012. Characterizing user navigation and interactions in online social networks. Inf. Sci. (2012).","DOI":"10.1016\/j.ins.2011.12.009"},{"key":"e_1_3_2_2_8_1","volume":"200","author":"Beygelzimer A.","unstructured":"A. Beygelzimer , S. Kakade , and J. Langford. 200 6. Cover trees for nearest neighbor. ICML (2006). A. Beygelzimer, S. Kakade, and J. Langford. 2006. Cover trees for nearest neighbor. ICML (2006).","journal-title":"J. Langford."},{"key":"e_1_3_2_2_9_1","unstructured":"C. Blundell Y. W. Teh and K. A. Heller. 2010. Bayesian rose trees. UAI (2010).  C. Blundell Y. W. Teh and K. A. Heller. 2010. Bayesian rose trees. UAI (2010)."},{"key":"e_1_3_2_2_10_1","unstructured":"O. Borr\u016fka. 1926. O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm. (1926).  O. Borr\u016fka. 1926. O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm. (1926)."},{"key":"e_1_3_2_2_11_1","unstructured":"T. Broderick B. Kulis and M. Jordan. 2013. MAD-Bayes: MAP-based asymptotic derivations from Bayes. ICML (2013).  T. Broderick B. Kulis and M. Jordan. 2013. MAD-Bayes: MAP-based asymptotic derivations from Bayes. ICML (2013)."},{"key":"e_1_3_2_2_12_1","volume":"201","author":"Campello R. J. G. B.","unstructured":"R. J. G. B. Campello , D. Moulavi , and J. Sander. 201 3. Density-Based Clustering Based on Hierarchical Density Estimates. Advances in Knowledge Discovery and Data Mining (2013). R. J. G. B. Campello, D. Moulavi, and J. Sander. 2013. Density-Based Clustering Based on Hierarchical Density Estimates. Advances in Knowledge Discovery and Data Mining (2013).","journal-title":"J. Sander."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","unstructured":"F. Cao M. Ester W. Qian and A. Zhou. 2006. Density-based clustering over an evolving data stream with noise. ICDM (2006).  F. Cao M. Ester W. Qian and A. Zhou. 2006. Density-based clustering over an evolving data stream with noise. ICDM (2006).","DOI":"10.1137\/1.9781611972764.29"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"M. Charikar V. Chatziafratis and R. Niazadeh. 2019. Hierarchical Clustering better than Average-Linkage. SODA (2019).  M. Charikar V. Chatziafratis and R. Niazadeh. 2019. Hierarchical Clustering better than Average-Linkage. SODA (2019).","DOI":"10.1137\/1.9781611975482.139"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"B. Chen A. Shrivastava R. C Steorts etal 2018. Unique entity estimation with application to the Syrian conflict. The Annals of Applied Statistics (2018).  B. Chen A. Shrivastava R. C Steorts et al. 2018. Unique entity estimation with application to the Syrian conflict. The Annals of Applied Statistics (2018).","DOI":"10.1214\/18-AOAS1163"},{"key":"e_1_3_2_2_16_1","unstructured":"K. Cranmer S. Macaluso and D. Pappadopulo. 2019. Toy Generative Model for Jets. (2019).  K. Cranmer S. Macaluso and D. Pappadopulo. 2019. Toy Generative Model for Jets. (2019)."},{"key":"e_1_3_2_2_17_1","volume-title":"Probabilistic Case-based Reasoning for Open-World Knowledge Graph Completion. Findings of EMNLP","author":"Das R.","year":"2020","unstructured":"R. Das , A. Godbole , N. Monath , M. Zaheer , and A. McCallum . 2020. Probabilistic Case-based Reasoning for Open-World Knowledge Graph Completion. Findings of EMNLP ( 2020 ). R. Das, A. Godbole, N. Monath, M. Zaheer, and A. McCallum. 2020. Probabilistic Case-based Reasoning for Open-World Knowledge Graph Completion. Findings of EMNLP (2020)."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897527"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"crossref","unstructured":"L. Ein Dor Y. Mass A. Halfon E. Venezian I. Shnayderman R. Aharonov and N. Slonim. 2018. Learning Thematic Similarity Metric from Article Sections Using Triplet Networks. ACL (2018).  L. Ein Dor Y. Mass A. Halfon E. Venezian I. Shnayderman R. Aharonov and N. Slonim. 2018. Learning Thematic Similarity Metric from Article Sections Using Triplet Networks. ACL (2018).","DOI":"10.18653\/v1\/P18-2009"},{"key":"e_1_3_2_2_20_1","volume-title":"Proceedings of the National Academy of Sciences","author":"Eisen M. B.","year":"1998","unstructured":"M. B. Eisen , P. T. Spellman , P. O. Brown , and D. Botstein . 1998. Cluster analysis and display of genome-wide expression patterns . Proceedings of the National Academy of Sciences ( 1998 ). M. B. Eisen, P. T. Spellman, P. O. Brown, and D. Botstein. 1998. Cluster analysis and display of genome-wide expression patterns. Proceedings of the National Academy of Sciences (1998)."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"B. Eriksson G. Dasarathy A. Singh and R. Nowak. 2011. Active clustering: Robust and efficient hierarchical clustering using adaptively selected similarities. AISTATS (2011).  B. Eriksson G. Dasarathy A. Singh and R. Nowak. 2011. Active clustering: Robust and efficient hierarchical clustering using adaptively selected similarities. AISTATS (2011).","DOI":"10.1109\/SSP.2012.6319773"},{"key":"e_1_3_2_2_22_1","unstructured":"M. Ester H-P Kriegel J Sander X Xu etal 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. KDD (1996).  M. Ester H-P Kriegel J Sander X Xu et al. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. KDD (1996)."},{"key":"e_1_3_2_2_23_1","volume":"201","author":"Gavryushkin A.","unstructured":"A. Gavryushkin and A. J Drummond. 201 6. The space of ultrametric phylogenetic trees. Journal of theoretical biology (2016). A. Gavryushkin and A. J Drummond. 2016. The space of ultrametric phylogenetic trees. Journal of theoretical biology (2016).","journal-title":"J Drummond."},{"key":"e_1_3_2_2_24_1","volume-title":"The Amsterdam Library of Object Images. IJCV","author":"Geusebroek J.M.","year":"2005","unstructured":"J.M. Geusebroek , G. J. Burghouts , and A. W. M. Smeulders . 2005. The Amsterdam Library of Object Images. IJCV ( 2005 ). J.M. Geusebroek, G. J. Burghouts, and A. W. M. Smeulders. 2005. The Amsterdam Library of Object Images. IJCV (2005)."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"crossref","unstructured":"S. Gilpin S. Nijssen and I. Davidson. 2013. Formalizing hierarchical clustering as integer linear programming. AAAI (2013).  S. Gilpin S. Nijssen and I. Davidson. 2013. Formalizing hierarchical clustering as integer linear programming. AAAI (2013).","DOI":"10.1609\/aaai.v27i1.8671"},{"key":"e_1_3_2_2_26_1","unstructured":"S. Green N. Andrews M. R. Gormley M. Dredze and C. D. Manning. 2012. Entity Clustering Across Languages. NAACL-HLT (2012).  S. Green N. Andrews M. R. Gormley M. Dredze and C. D. Manning. 2012. Entity Clustering Across Languages. NAACL-HLT (2012)."},{"key":"e_1_3_2_2_27_1","volume-title":"The NIST 2014 speaker recognition i-vector machine learning challenge. Odyssey: The Speaker and Language Recognition Workshop","author":"al Greenberg C. S","year":"2014","unstructured":"C. S et al Greenberg . 2014 . The NIST 2014 speaker recognition i-vector machine learning challenge. Odyssey: The Speaker and Language Recognition Workshop (2014). C. S et al Greenberg. 2014. The NIST 2014 speaker recognition i-vector machine learning challenge. Odyssey: The Speaker and Language Recognition Workshop (2014)."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"A. Gro\u00dfwendt H. R\u00f6glin and M. Schmidt. 2019. Analysis of ward's method. SODA (2019).  A. Gro\u00dfwendt H. R\u00f6glin and M. Schmidt. 2019. Analysis of ward's method. SODA (2019).","DOI":"10.1137\/1.9781611975482.182"},{"key":"e_1_3_2_2_29_1","volume-title":"et al Guo","author":"R.","year":"2020","unstructured":"R. et al Guo . 2020 . Accelerating Large-Scale Inference with Anisotropic Vector Quantization. In ICML. R. et al Guo. 2020. Accelerating Large-Scale Inference with Anisotropic Vector Quantization. In ICML."},{"key":"e_1_3_2_2_30_1","volume-title":"EU-PASCAL Statistics and Optimization of Clustering Workshop","author":"Heller K","year":"2005","unstructured":"K Heller and Zoubin Ghahramani . 2005 a. Randomized algorithms for fast Bayesian hierarchical clustering . EU-PASCAL Statistics and Optimization of Clustering Workshop (2005). K Heller and Zoubin Ghahramani. 2005 a. Randomized algorithms for fast Bayesian hierarchical clustering. EU-PASCAL Statistics and Optimization of Clustering Workshop (2005)."},{"key":"e_1_3_2_2_31_1","volume-title":"2005 b. Bayesian hierarchical clustering. ICML","author":"Heller K. A.","year":"2005","unstructured":"K. A. Heller and Z. Ghahramani . 2005 b. Bayesian hierarchical clustering. ICML ( 2005 ). K. A. Heller and Z. Ghahramani. 2005 b. Bayesian hierarchical clustering. ICML (2005)."},{"key":"e_1_3_2_2_32_1","volume-title":"Small-variance asymptotics for exponential family Dirichlet process mixture models. NeurIPS","author":"Jiang K.","year":"2012","unstructured":"K. Jiang , B. Kulis , and M. I Jordan . 2012. Small-variance asymptotics for exponential family Dirichlet process mixture models. NeurIPS ( 2012 ). K. Jiang, B. Kulis, and M. I Jordan. 2012. Small-variance asymptotics for exponential family Dirichlet process mixture models. NeurIPS (2012)."},{"key":"e_1_3_2_2_33_1","volume-title":"et al Jin","author":"C.","year":"2015","unstructured":"C. et al Jin . 2015 . A scalable hierarchical clustering algorithm using spark. BigDataService ( 2015). C. et al Jin. 2015. A scalable hierarchical clustering algorithm using spark. BigDataService (2015)."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"crossref","unstructured":"K. Kenyon-Dean J. C. K. Cheung and D. Precup. 2018. Resolving Event Coreference with Supervised Representation Learning and Clustering-Oriented Regularization. *SEM (2018).  K. Kenyon-Dean J. C. K. Cheung and D. Precup. 2018. Resolving Event Coreference with Supervised Representation Learning and Clustering-Oriented Regularization. *SEM (2018).","DOI":"10.18653\/v1\/S18-2001"},{"key":"e_1_3_2_2_35_1","unstructured":"J. Kleinberg. 200"},{"key":"e_1_3_2_2_36_1","volume-title":"Integrating User Feedback under Identity Uncertainty in Knowledge Base Construction. AKBC","author":"Kobren A.","year":"2019","unstructured":"A. Kobren , N. Monath , and A. McCallum . 2019. Integrating User Feedback under Identity Uncertainty in Knowledge Base Construction. AKBC ( 2019 ). A. Kobren, N. Monath, and A. McCallum. 2019. Integrating User Feedback under Identity Uncertainty in Knowledge Base Construction. AKBC (2019)."},{"key":"e_1_3_2_2_37_1","volume-title":"A hierarchical algorithm for extreme clustering. KDD","author":"Kobren N.","year":"2017","unstructured":"N. Kobren , A.and Monath, A. Krishnamurthy , and A. McCallum . 2017. A hierarchical algorithm for extreme clustering. KDD ( 2017 ). N. Kobren, A.and Monath, A. Krishnamurthy, and A. McCallum. 2017. A hierarchical algorithm for extreme clustering. KDD (2017)."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"crossref","unstructured":"P. Kranen I. Assent C. Baldauf and T. Seidl. 2011. The ClusTree: indexing micro-clusters for anytime stream mining. KIS (2011).  P. Kranen I. Assent C. Baldauf and T. Seidl. 2011. The ClusTree: indexing micro-clusters for anytime stream mining. KIS (2011).","DOI":"10.1007\/s10115-010-0342-8"},{"key":"e_1_3_2_2_39_1","unstructured":"A. Krishnamurthy S. Balakrishnan M. Xu and A. Singh. 2012. Efficient active algorithms for hierarchical clustering. ICML (2012).  A. Krishnamurthy S. Balakrishnan M. Xu and A. Singh. 2012. Efficient active algorithms for hierarchical clustering. ICML (2012)."},{"key":"e_1_3_2_2_40_1","unstructured":"B. Kulis and M. I. Jordan. 2012. Revisiting K-Means: New Algorithms via Bayesian Nonparametrics. ICML (2012).  B. Kulis and M. I. Jordan. 2012. Revisiting K-Means: New Algorithms via Bayesian Nonparametrics. ICML (2012)."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"crossref","unstructured":"S. Kushagra S. Samadi and S. Ben-David. 2016. Finding meaningful cluster structure amidst background noise. ALT (2016).  S. Kushagra S. Samadi and S. Ben-David. 2016. Finding meaningful cluster structure amidst background noise. ALT (2016).","DOI":"10.1007\/978-3-319-46379-7_23"},{"key":"e_1_3_2_2_42_1","unstructured":"H. Lee M. Recasens A. Chang M. Surdeanu and D. Jurafsky. 2012. Joint entity and event coreference resolution across documents. EMNLP-CoNLL (2012).  H. Lee M. Recasens A. Chang M. Surdeanu and D. Jurafsky. 2012. Joint entity and event coreference resolution across documents. EMNLP-CoNLL (2012)."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"crossref","unstructured":"M. Mahajan P. Nimbhorkar and K. Varadarajan. 2009. The planar k-means problem is NP-hard. WALCOM (2009).  M. Mahajan P. Nimbhorkar and K. Varadarajan. 2009. The planar k-means problem is NP-hard. WALCOM (2009).","DOI":"10.1007\/978-3-642-00202-1_24"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"crossref","unstructured":"C. D. Manning Prabhakar Raghavan and Hinrich Sch\u00fctze. 2008. Introduction to Information Retrieval.  C. D. Manning Prabhakar Raghavan and Hinrich Sch\u00fctze. 2008. Introduction to Information Retrieval.","DOI":"10.1017\/CBO9780511809071"},{"key":"e_1_3_2_2_45_1","volume-title":"2019 a. Scalable Hierarchical Clustering with Tree Grafting. KDD","author":"Monath N.","year":"2019","unstructured":"N. Monath , Akshay Kobren , A.and Krishnamurthy, Michael R Glass , and A. McCallum . 2019 a. Scalable Hierarchical Clustering with Tree Grafting. KDD ( 2019 ). N. Monath, Akshay Kobren, A.and Krishnamurthy, Michael R Glass, and A. McCallum. 2019 a. Scalable Hierarchical Clustering with Tree Grafting. KDD (2019)."},{"key":"e_1_3_2_2_46_1","volume-title":"2019 b. Gradient-Based Hierarchical Clustering Using Continuous Representations of Trees in Hyperbolic Space. KDD","author":"Monath N.","year":"2019","unstructured":"N. Monath , M. Zaheer , D. Silva , A. McCallum , and A. Ahmed . 2019 b. Gradient-Based Hierarchical Clustering Using Continuous Representations of Trees in Hyperbolic Space. KDD ( 2019 ). N. Monath, M. Zaheer, D. Silva, A. McCallum, and A. Ahmed. 2019 b. Gradient-Based Hierarchical Clustering Using Continuous Representations of Trees in Hyperbolic Space. KDD (2019)."},{"key":"e_1_3_2_2_47_1","volume":"201","author":"Moseley B.","unstructured":"B. Moseley and J. Wang. 201 7. Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search. NeurIPS (2017). B. Moseley and J. Wang. 2017. Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search. NeurIPS (2017).","journal-title":"J. Wang."},{"key":"e_1_3_2_2_48_1","volume-title":"Parallel algorithms for hierarchical clustering. Parallel computing","author":"Olson C. F","year":"1995","unstructured":"C. F Olson . 1995. Parallel algorithms for hierarchical clustering. Parallel computing ( 1995 ). C. F Olson. 1995. Parallel algorithms for hierarchical clustering. Parallel computing (1995)."},{"key":"e_1_3_2_2_49_1","volume-title":"Optimistic concurrency control for distributed unsupervised learning. NeurIPS","author":"Pan X.","year":"2013","unstructured":"X. Pan , J. E Gonzalez , S. Jegelka , T. Broderick , and M. I Jordan . 2013. Optimistic concurrency control for distributed unsupervised learning. NeurIPS ( 2013 ). X. Pan, J. E Gonzalez, S. Jegelka, T. Broderick, and M. I Jordan. 2013. Optimistic concurrency control for distributed unsupervised learning. NeurIPS (2013)."},{"key":"e_1_3_2_2_50_1","volume-title":"et al Russakovsky","author":"O.","year":"2015","unstructured":"O. et al Russakovsky . 2015 . Imagenet large scale visual recognition challenge. IJCV ( 2015). O. et al Russakovsky. 2015. Imagenet large scale visual recognition challenge. IJCV (2015)."},{"key":"e_1_3_2_2_51_1","volume":"201","author":"Santos J.","unstructured":"J. Santos , T. Syed , M. C. Naldi , R. JGB Campello , and J. Sander. 201 9. Hierarchical Density-Based Clustering using MapReduce. TBD (2019). J. Santos, T. Syed, M. C. Naldi, R. JGB Campello, and J. Sander. 2019. Hierarchical Density-Based Clustering using MapReduce. TBD (2019).","journal-title":"J. Sander."},{"key":"e_1_3_2_2_52_1","volume-title":"W et al Schwartz","author":"G.","year":"2020","unstructured":"G. W et al Schwartz . 2020 . TooManyCells identifies and visualizes relationships of single-cell clades. Nat. Methods ( 2020). G. W et al Schwartz. 2020. TooManyCells identifies and visualizes relationships of single-cell clades. Nat. Methods (2020)."},{"key":"e_1_3_2_2_53_1","unstructured":"V. V Vazirani. 2013. Approximation algorithms.  V. V Vazirani. 2013. Approximation algorithms."},{"key":"e_1_3_2_2_54_1","unstructured":"F. Vitale A. Rajagopalan and C. Gentile. 2019. Flattening a Hierarchical Clustering through Active Learning. NeurIPS (2019).  F. Vitale A. Rajagopalan and C. Gentile. 2019. Flattening a Hierarchical Clustering through Active Learning. NeurIPS (2019)."},{"key":"e_1_3_2_2_55_1","unstructured":"N. Yadav A. Kobren N. Monath and A. Mccallum. 2019. Supervised Hierarchical Clustering with Exponential Linkage. ICML (2019).  N. Yadav A. Kobren N. Monath and A. Mccallum. 2019. Supervised Hierarchical Clustering with Exponential Linkage. ICML (2019)."},{"key":"e_1_3_2_2_56_1","unstructured":"G. Yaroslavtsev and A. Vadapalli. 2018. Massively Parallel Algorithms and Hardness for Single-Linkage Clustering under \u2113p Distances. ICML (2018).  G. Yaroslavtsev and A. Vadapalli. 2018. Massively Parallel Algorithms and Hardness for Single-Linkage Clustering under \u2113p Distances. ICML (2018)."},{"key":"e_1_3_2_2_57_1","unstructured":"I. E.H. Yen D. Malioutov and A. Kumar. 2016. Scalable exemplar clustering and facility location via augmented block coordinate descent with column generation. AISTATS (2016).  I. E.H. Yen D. Malioutov and A. Kumar. 2016. Scalable exemplar clustering and facility location via augmented block coordinate descent with column generation. AISTATS (2016)."},{"key":"e_1_3_2_2_58_1","volume-title":"Canopy--fast sampling with cover trees. ICML","author":"Zaheer M.","year":"2017","unstructured":"M. Zaheer , S. Kottur , A. Ahmed , J. Moura , and Alex Smola . 2017. Canopy--fast sampling with cover trees. ICML ( 2017 ). M. Zaheer, S. Kottur, A. Ahmed, J. Moura, and Alex Smola. 2017. Canopy--fast sampling with cover trees. ICML (2017)."},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"crossref","unstructured":"T. Zhang R. Ramakrishnan and M. Livny. 1996. BIRCH: an efficient data clustering method for very large databases. SIGMOD (1996).  T. Zhang R. Ramakrishnan and M. Livny. 1996. BIRCH: an efficient data clustering method for very large databases. SIGMOD (1996).","DOI":"10.1145\/233269.233324"},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"crossref","unstructured":"Y. Zhang A. Ahmed V. Josifovski and A. Smola. 2014. Taxonomy discovery for personalized recommendation. WSDM (2014).  Y. Zhang A. Ahmed V. Josifovski and A. Smola. 2014. Taxonomy discovery for personalized recommendation. WSDM (2014).","DOI":"10.1145\/2556195.2556236"},{"key":"e_1_3_2_2_61_1","volume":"201","author":"Zhang Y.","unstructured":"Y. Zhang , F. Zhang , P. Yao , and J. Tang. 201 8. Name Disambiguation in AMiner: Clustering, Maintenance, and Human in the Loop. KDD (2018). Y. Zhang, F. Zhang, P. Yao, and J. Tang. 2018. Name Disambiguation in AMiner: Clustering, Maintenance, and Human in the Loop. KDD (2018).","journal-title":"J. Tang."},{"key":"e_1_3_2_2_62_1","unstructured":"H. Zhu and W. Stuetzle. 2019. A Simple and Efficient Method to Compute a Single Linkage Dendrogram. arXiv (2019).  H. Zhu and W. Stuetzle. 2019. A Simple and Efficient Method to Compute a Single Linkage Dendrogram. arXiv (2019)."}],"event":{"name":"KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Virtual Event Singapore","acronym":"KDD '21","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 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447548.3467404","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3447548.3467404","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3447548.3467404","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:36Z","timestamp":1750191516000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447548.3467404"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,14]]},"references-count":62,"alternative-id":["10.1145\/3447548.3467404","10.1145\/3447548"],"URL":"https:\/\/doi.org\/10.1145\/3447548.3467404","relation":{},"subject":[],"published":{"date-parts":[[2021,8,14]]},"assertion":[{"value":"2021-08-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}