{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T15:13:20Z","timestamp":1773155600957,"version":"3.50.1"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2019,3,1]]},"DOI":"10.1109\/tpami.2018.2815524","type":"journal-article","created":{"date-parts":[[2018,3,13]],"date-time":"2018-03-13T18:21:44Z","timestamp":1520965304000},"page":"669-681","source":"Crossref","is-referenced-by-count":11,"title":["Recursive Nearest Agglomeration (ReNA): Fast Clustering for Approximation of Structured Signals"],"prefix":"10.1109","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1729-1927","authenticated-orcid":false,"given":"Andres","family":"Hoyos-Idrobo","sequence":"first","affiliation":[]},{"given":"Gael","family":"Varoquaux","sequence":"additional","affiliation":[]},{"given":"Jonas","family":"Kahn","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5018-7895","authenticated-orcid":false,"given":"Bertrand","family":"Thirion","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.01.009"},{"key":"ref38","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","author":"ester","year":"1996","journal-title":"KDD"},{"key":"ref33","doi-asserted-by":"crossref","DOI":"10.1145\/321356.321357","article-title":"Sequential operations in digital picture processing","volume":"13","author":"rosenfeld","year":"1966","journal-title":"J ACM"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-72087-1_20"},{"key":"ref31","article-title":"Modern hierarchical, agglomerative clustering algorithms","author":"m\u00fcllner","year":"2011","journal-title":"ArXiv e-prints arXiv 1109 2378"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500845"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009293"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000022288.19776.77"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.3389\/fnins.2014.00167"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1006\/jmva.1995.1026"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1137856.1137880"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.120"},{"key":"ref29","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-84858-7","author":"hastie","year":"2009","journal-title":"The Elements of Statistical Learning"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neuroimage.2012.02.018"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bts706"},{"key":"ref20","first-page":"369","article-title":"Faster ridge regression via the subsampled randomized Hadamard transform","author":"lu","year":"2013","journal-title":"Proc NIPS"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1142\/S1793536911000787"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00025-4"},{"key":"ref24","first-page":"1648","article-title":"Less is more: Nyström computational regularization","author":"rudi","year":"2015","journal-title":"Proc NIPS"},{"key":"ref23","first-page":"682","article-title":"Using the Nyström method to speed up kernel machines","author":"williams","year":"2001","journal-title":"Proc NIPS"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2016.2543461"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.jspi.2013.05.019"},{"key":"ref50","article-title":"SciPy: Open source scientific tools for Python","author":"jones","year":"2014"},{"key":"ref51","first-page":"900","article-title":"Learning sparse representations of high dimensional data on large scale dictionaries","author":"xiang","year":"2011","journal-title":"Proc NIPS"},{"key":"ref57","article-title":"Small-sample brain mapping: Sparse recovery on spatially correlated designs with randomization and clustering","author":"varoquaux","year":"2012","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref56","first-page":"1737","article-title":"Dictionary learning for massive matrix factorization","author":"mensch","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.neuroimage.2013.05.039"},{"key":"ref54","first-page":"1673","article-title":"Mapping cognitive ontologies to and from the brain","author":"schwartz","year":"0","journal-title":"Proc NIPS"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1023\/B:MACH.0000035475.85309.1b"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1177153"},{"key":"ref10","first-page":"1177","article-title":"Random features for large-scale kernel machines","author":"rahimi","year":"2007","journal-title":"Proc 20th Int Conf Neural Inf Process Syst"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/060673096"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9040-7"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"ref13","first-page":"567","article-title":"Revisiting the Nyström method for improved large-scale machine learning","author":"gittens","year":"2013","journal-title":"Proc ICML"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1073\/pnas.0803205106","article-title":"CUR matrix decompositions for improved data analysis","volume":"106","author":"mahoney","year":"2009","journal-title":"PNAS"},{"key":"ref15","first-page":"189","article-title":"Extensions of Lipschitz mappings into a Hilbert space","volume":"26","author":"johnson","year":"1984","journal-title":"Proc Conf Modern Anal and Probability"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-007-0064-z"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2235192"},{"key":"ref18","author":"stauffer","year":"1971","journal-title":"Introduction to Percolation Theory"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2452228"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"633d","DOI":"10.1093\/nar\/gkt1244","article-title":"Ribosomal database project: Data and tools for high throughput rrna analysis","volume":"42","author":"cole","year":"2013","journal-title":"Nucleic Acids Res"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/28.1.123"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-009-0285-2"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cageo.2014.01.014"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/568518.568520"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/PRNI.2015.30"},{"key":"ref49","article-title":"Scikit-image: Image processing in Python","volume":"2","author":"sch\u00f6nberger","year":"2014","journal-title":"PeerJ"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/PL00011669"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.neuroimage.2013.05.033"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.neuroimage.2004.12.007"},{"key":"ref48","article-title":"Scikit-learn: Machine learning in Python","volume":"12","author":"pedregosa","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.neuroimage.2013.04.127"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"ref41","article-title":"An improved algorithm for finding the strongly connected components of a directed graph","author":"pearce","year":"2005"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1162\/jocn.2007.19.9.1498"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.79"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/8635379\/08315069.pdf?arnumber=8315069","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:13:56Z","timestamp":1657746836000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8315069\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,1]]},"references-count":57,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2018.2815524","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"},{"value":"1939-3539","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,1]]}}}