{"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/robust-subspace-clustering-via-thresholding","title":"Robust Subspace Clustering via Thresholding","arxiv_id":"1307.4891","date":"2013-07-18","proceeding":null,"authors":["Reinhard Heckel","Helmut Bölcskei"],"abstract":"The problem of clustering noisy and incompletely observed high-dimensional\ndata points into a union of low-dimensional subspaces and a set of outliers is\nconsidered. The number of subspaces, their dimensions, and their orientations\nare assumed unknown. We propose a simple low-complexity subspace clustering\nalgorithm, which applies spectral clustering to an adjacency matrix obtained by\nthresholding the correlations between data points. In other words, the\nadjacency matrix is constructed from the nearest neighbors of each data point\nin spherical distance. A statistical performance analysis shows that the\nalgorithm exhibits robustness to additive noise and succeeds even when the\nsubspaces intersect. Specifically, our results reveal an explicit tradeoff\nbetween the affinity of the subspaces and the tolerable noise level. We\nfurthermore prove that the algorithm succeeds even when the data points are\nincompletely observed with the number of missing entries allowed to be (up to a\nlog-factor) linear in the ambient dimension. We also propose a simple scheme\nthat provably detects outliers, and we present numerical results on real and\nsynthetic data.","url_abs":"http://arxiv.org/abs/1307.4891v4","url_pdf":"http://arxiv.org/pdf/1307.4891v4.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":"robust-subspace-clustering-via-thresholding","repo_url":"https://github.com/omarghanem1210/threshold_clustering","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"}],"methods":[{"method_slug":"spectral-clustering","method_name":"Spectral Clustering"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1307.4891","atlas_url":"https://app.syntology.ai/?focus=1307.4891","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1307.4891"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1307.4891\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1307.4891"},"call":"get_concepts_for_paper(arxiv_id=\"1307.4891\")"}],"by_repo":[{"repo":"omarghanem1210/threshold_clustering","kind":"listed","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":"6026123ccabecc62a24bd96d2cd47dc769f6de0a44c838f3add00f379caa5e30","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}