{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T16:28:56Z","timestamp":1787329736208,"version":"build-2736575974"},"reference-count":55,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","funder":[{"DOI":"10.13039\/100000879","name":"Alfred P. Sloan Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000879","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1752692"],"award-info":[{"award-number":["DMS-1752692"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1763179"],"award-info":[{"award-number":["DMS-1763179"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM Journal on Mathematics of Data Science"],"published-print":{"date-parts":[[2019,1]]},"abstract":"<jats:p>Hierarchical clustering is a fundamental unsupervised learning task, whose aim is to organize a collection of points into a tree of nested clusters. Convex clustering has been proposed recently as a new way to construct tree organizations of data that are more robust to perturbations in the input data than standard hierarchical clustering algorithms. In this paper, we present conditions that guarantee when the convex clustering solution path recovers a tree and also make explicit how affinity parameters in the convex clustering formulation modulate the structure of the recovered tree. The proof of our main result relies on establishing a novel property of point clouds in a Hilbert space, which is potentially of independent interest.<\/jats:p>","DOI":"10.1137\/18m121099x","type":"journal-article","created":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T11:30:56Z","timestamp":1562671856000},"page":"383-407","source":"Crossref","is-referenced-by-count":15,"title":["Recovering Trees with Convex Clustering"],"prefix":"10.1137","volume":"1","author":[{"given":"Eric C.","family":"Chi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Steinerberger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2019,7,9]]},"reference":[{"key":"atypb1","unstructured":"Americans for Democratic Action, 2001\n                      voting record: Shattered promise of liberal progress\n                      , ADA Today, 57 (2002), pp. 1-17."},{"key":"atypb2","unstructured":"J. I. Ankenman,\n                      Geometry and Analysis of Dual Networks on Questionnaires\n                      , Ph.D. thesis, Yale University, 2014."},{"key":"atypb3","doi-asserted-by":"crossref","first-page":"1373","DOI":"10.1162\/089976603321780317","volume":"15","author":"Belkin M.","year":"2003","journal-title":"Neural Comput."},{"key":"atypb4","first-page":"217","author":"Beyer K. S.","year":"1999","journal-title":"Springer-Verlag"},{"key":"atypb5","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1111\/j.1541-0420.2007.00843.x","volume":"64","author":"Bondell H. D.","year":"2008","journal-title":"Biometrics"},{"key":"atypb6","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1016\/j.neuron.2006.07.018","volume":"51","author":"Broome B. M.","year":"2006","journal-title":"Neuron"},{"key":"atypb7","doi-asserted-by":"crossref","first-page":"1568","DOI":"10.1038\/nn1559","volume":"8","author":"Brown S. L.","year":"2005","journal-title":"Nature Neurosci."},{"key":"atypb8","doi-asserted-by":"crossref","first-page":"1435","DOI":"10.1152\/jn.01131.2007","volume":"99","author":"Carrillo-Reid L.","year":"2008","journal-title":"J. Neurophys."},{"key":"atypb9","doi-asserted-by":"crossref","first-page":"e1004228","DOI":"10.1371\/journal.pcbi.1004228","volume":"11","author":"Chen G. K.","year":"2015","journal-title":"PLoS Comput. Biol."},{"key":"atypb10","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1111\/biom.12540","volume":"73","author":"Chi E. C.","year":"2017","journal-title":"Biometrics"},{"key":"atypb11","unstructured":"E. C. Chi, B. R. Gaines, W. W. Sun, H. Zhou, and J. Yang,\n                      Provable Convex Co-clustering of Tensors\n                      , preprint,https:\/\/arxiv.org\/abs\/1803.06518, 2018."},{"key":"atypb12","doi-asserted-by":"crossref","first-page":"994","DOI":"10.1080\/10618600.2014.948181","volume":"24","author":"Chi E. C.","year":"2015","journal-title":"J. Comput. Graph. Statist."},{"key":"atypb13","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.acha.2006.04.006","volume":"21","author":"Coifman R. R.","year":"2006","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"atypb14","first-page":"1","volume":"31","author":"J","year":"2009","journal-title":"J. Statist. Software"},{"key":"atypb15","doi-asserted-by":"crossref","first-page":"5591","DOI":"10.1073\/pnas.1031596100","volume":"100","author":"Donoho D. L.","year":"2003","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"atypb16","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"Fan J.","year":"2001","journal-title":"J. Amer. Statist. Assoc."},{"key":"atypb17","doi-asserted-by":"crossref","first-page":"1863","DOI":"10.1016\/j.compbiomed.2013.08.025","volume":"43","author":"Garc\u00eda-G\u00f3mez J. M.","year":"2013","journal-title":"Comput. Biol. Med."},{"key":"atypb18","doi-asserted-by":"crossref","first-page":"54","DOI":"10.2307\/2346439","volume":"18","author":"Gower J. C.","year":"1969","journal-title":"Appl. Statist."},{"key":"atypb19","first-page":"745","author":"Hocking T. D.","year":"2011","journal-title":"Omnipress"},{"key":"atypb20","doi-asserted-by":"crossref","unstructured":"X. Jiang, X. Hu, H. Shen, and T. He,\n                      Manifold learning reveals nonlinear structure in metagenomic profiles\n                      , in 2012 IEEE International Conference on Bioinformatics and Biomedicine, 2012, pp. 1-6.","DOI":"10.1109\/BIBM.2012.6392684"},{"key":"atypb21","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF02289588","volume":"32","author":"Johnson S. C.","year":"1967","journal-title":"Psychometrika"},{"key":"atypb22","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1080\/01621459.2014.892882","volume":"110","author":"Ke Z. T.","year":"2015","journal-title":"J. Amer. Stat. Assoc."},{"key":"atypb23","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1093\/comjnl\/9.4.373","volume":"9","author":"Lance G. N.","year":"1967","journal-title":"Comput. J."},{"key":"atypb24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/10618600.2000.10474858","volume":"9","author":"Lange K.","year":"2000","journal-title":"J. Comput. Graph. Statist."},{"key":"atypb25","unstructured":"F. Lindsten, H. Ohlsson, and L. Ljung,\n                      Just Relax and Come Clustering! A Convexification of $k$-Means Clustering\n                      , Tech. report, Link\u00f6pings Universitet, 2011."},{"key":"atypb26","doi-asserted-by":"crossref","first-page":"1569","DOI":"10.1214\/14-EJS934","volume":"8","author":"Marchetti Y.","year":"2014","journal-title":"Electron. J. Statist."},{"key":"atypb27","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1089\/cmb.2009.0258","volume":"18","author":"Marras E.","year":"2010","journal-title":"J. Comput. Biol."},{"key":"atypb28","first-page":"451","volume":"4","author":"Mishne G.","year":"2018","journal-title":"IEEE Trans. Signal Inform. Process. Netw."},{"key":"atypb29","doi-asserted-by":"crossref","first-page":"1238","DOI":"10.1109\/JSTSP.2016.2602061","volume":"10","author":"Mishne G.","year":"2016","journal-title":"IEEE J. Selected Topics Signal Process."},{"key":"atypb30","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1093\/comjnl\/26.4.354","volume":"26","author":"Murtagh F.","year":"1983","journal-title":"Comput. J."},{"key":"atypb31","first-page":"1865","volume":"14","author":"Pan W.","year":"2013","journal-title":"J. Mach. Learn. Res."},{"key":"atypb32","unstructured":"A. Panahi, D. Dubhashi, F. D. Johansson, and C. Bhattacharyya,\n                      Clustering by sum of norms: Stochastic incremental algorithm, convergence and cluster recovery\n                      , in Proceedings of the 34th International Conference on Machine Learning, D. Precup and Y. W. Teh, eds., Proc. Mach. Learn. Res. 70, JMLR.org, 2015, pp. 2769-2777."},{"key":"atypb33","unstructured":"K. Pelckmans, J. De Brabanter, J. Suykens, and B. De Moor,\n                      Convex clustering shrinkage\n                      , in PASCAL Workshop on Statistics and Optimization of Clustering Workshop, 2005."},{"key":"atypb34","doi-asserted-by":"crossref","first-page":"1527","DOI":"10.1111\/rssb.12226","volume":"79","author":"Radchenko P.","year":"2017","journal-title":"J. R. Stat. Soc. Ser. B. Stat. Methodol."},{"key":"atypb35","doi-asserted-by":"crossref","first-page":"2323","DOI":"10.1126\/science.290.5500.2323","volume":"290","author":"Roweis S. T.","year":"2000","journal-title":"Science"},{"key":"atypb36","doi-asserted-by":"crossref","first-page":"1830","DOI":"10.1038\/nn.3570","volume":"16","author":"Saha D.","year":"2013","journal-title":"Nature Neurosci."},{"key":"atypb37","doi-asserted-by":"crossref","first-page":"1258","DOI":"10.1214\/10-EJS582","volume":"4","author":"Schifano E. D.","year":"2010","journal-title":"Electron. J. Statist."},{"key":"atypb38","unstructured":"J. Sharpnack, A. Singh, and A. Rinaldo,\n                      Sparsistency of the edge lasso over graphs\n                      , in Proceedings of the 15th International Conference on Artificial Intelligence and Statistics (AISTATS), PMLR.org, 2012, pp. 1028-1036."},{"key":"atypb39","first-page":"1055","volume":"4","author":"She Y.","year":"2010","journal-title":"Electron. J. Statist."},{"key":"atypb40","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1016\/j.neuron.2003.08.011","volume":"39","author":"Stopfer M.","year":"2003","journal-title":"Neuron"},{"key":"atypb41","unstructured":"D. Sun, K.C. Toh, and Y. Yuan,\n                      Convex Clustering: Model, Theoretical Guarantee and Efficient Algorithm\n                      , preprint,https:\/\/arxiv.org\/abs\/1810.02677, 2018."},{"key":"atypb42","first-page":"2324","volume":"9","author":"Tan K. M.","year":"2015","journal-title":"Electron. J. Statist."},{"key":"atypb43","doi-asserted-by":"crossref","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","volume":"290","author":"Tenenbaum J. B.","year":"2000","journal-title":"Science"},{"key":"atypb44","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1111\/j.1467-9868.2005.00490.x","volume":"67","author":"Tibshirani R.","year":"2005","journal-title":"J. R. Stat. Soc. Ser. B Stat. Methodol."},{"key":"atypb45","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1126\/science.1250298","volume":"344","author":"Vogelstein J. T.","year":"2014","journal-title":"Science"},{"key":"atypb46","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1080\/10618600.2017.1377081","volume":"27","author":"Wang B.","year":"2018","journal-title":"J. Comput. Graph. Statist."},{"key":"atypb47","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1080\/01621459.1963.10500845","volume":"58","author":"Ward J. H.","year":"1963","journal-title":"J. Amer. Statist. Assoc."},{"key":"atypb48","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1080\/00401706.2013.810174","volume":"56","author":"Witten D. M.","year":"2014","journal-title":"Technometrics"},{"key":"atypb49","first-page":"1","volume":"17","author":"Wu C.","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"atypb50","doi-asserted-by":"crossref","first-page":"2744","DOI":"10.1093\/bioinformatics\/btq510","volume":"26","author":"You Z.-H.","year":"2010","journal-title":"Bioinformatics"},{"key":"atypb51","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"Yuan M.","year":"2006","journal-title":"J. R. Stat. Soc. Ser. B Stat. Methodol."},{"key":"atypb52","unstructured":"L. Zelnik-Manor and P. Perona,\n                      Self-tuning spectral clustering\n                      , in Advances in Neural Information Processing Systems 17, L. K. Saul, Y. Weiss, and L. Bottou, eds., MIT Press, 2005, pp. 1601-1608."},{"key":"atypb53","first-page":"894","volume":"38","author":"Zhang C.-H.","year":"2010","journal-title":"Ann. Statist."},{"key":"atypb54","first-page":"1619","author":"Zhu C.","year":"2014","journal-title":"Curran Associates"},{"key":"atypb55","first-page":"1509","volume":"36","author":"Zou H.","year":"2008","journal-title":"Ann. Statist."}],"container-title":["SIAM Journal on Mathematics of Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/18M121099X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T15:30:53Z","timestamp":1787326253000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/18M121099X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":55,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["10.1137\/18M121099X"],"URL":"https:\/\/doi.org\/10.1137\/18m121099x","relation":{},"ISSN":["2577-0187"],"issn-type":[{"value":"2577-0187","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1]]}}}