{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/recursive-nearest-agglomeration-rena-fast","title":"Recursive nearest agglomeration (ReNA): fast clustering for approximation of structured signals","arxiv_id":"1609.04608","date":"2016-09-15","proceeding":null,"authors":["Andrés Hoyos-Idrobo","Gaël Varoquaux","Jonas Kahn","Bertrand Thirion"],"abstract":"In this work, we revisit fast dimension reduction approaches, as with random\nprojections and random sampling. Our goal is to summarize the data to decrease\ncomputational costs and memory footprint of subsequent analysis. Such dimension\nreduction can be very efficient when the signals of interest have a strong\nstructure, such as with images. We focus on this setting and investigate\nfeature clustering schemes for data reductions that capture this structure. An\nimpediment to fast dimension reduction is that good clustering comes with large\nalgorithmic costs. We address it by contributing a linear-time agglomerative\nclustering scheme, Recursive Nearest Agglomeration (ReNA). Unlike existing fast\nagglomerative schemes, it avoids the creation of giant clusters. We empirically\nvalidate that it approximates the data as well as traditional\nvariance-minimizing clustering schemes that have a quadratic complexity. In\naddition, we analyze signal approximation with feature clustering and show that\nit can remove noise, improving subsequent analysis steps. As a consequence,\ndata reduction by clustering features with ReNA yields very fast and accurate\nmodels, enabling to process large datasets on budget. Our theoretical analysis\nis backed by extensive experiments on publicly-available data that illustrate\nthe computation efficiency and the denoising properties of the resulting\ndimension reduction scheme.","url_abs":"http://arxiv.org/abs/1609.04608v2","url_pdf":"http://arxiv.org/pdf/1609.04608v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"recursive-nearest-agglomeration-rena-fast","repo_url":"https://github.com/ahoyosid/ReNA","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"denoising","task_name":"Denoising"},{"task_slug":"dimensionality-reduction","task_name":"Dimensionality Reduction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"ahoyosid/ReNA","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"580cb7602a049a9fbce782401df046d09b58b3a4b93dd95ee498ad3582b5669e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}