{"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/preconditioned-data-sparsification-for-big","title":"Preconditioned Data Sparsification for Big Data with Applications to PCA and K-means","arxiv_id":"1511.00152","date":"2015-10-31","proceeding":null,"authors":["Farhad Pourkamali-Anaraki","Stephen Becker"],"abstract":"We analyze a compression scheme for large data sets that randomly keeps a\nsmall percentage of the components of each data sample. The benefit is that the\noutput is a sparse matrix and therefore subsequent processing, such as PCA or\nK-means, is significantly faster, especially in a distributed-data setting.\nFurthermore, the sampling is single-pass and applicable to streaming data. The\nsampling mechanism is a variant of previous methods proposed in the literature\ncombined with a randomized preconditioning to smooth the data. We provide\nguarantees for PCA in terms of the covariance matrix, and guarantees for\nK-means in terms of the error in the center estimators at a given step. We\npresent numerical evidence to show both that our bounds are nearly tight and\nthat our algorithms provide a real benefit when applied to standard test data\nsets, as well as providing certain benefits over related sampling approaches.","url_abs":"http://arxiv.org/abs/1511.00152v3","url_pdf":"http://arxiv.org/pdf/1511.00152v3.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":"preconditioned-data-sparsification-for-big","repo_url":"https://github.com/stephenbeckr/SparsifiedKMeans","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"preconditioned-data-sparsification-for-big","repo_url":"https://github.com/erickightley/sparseklearn","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[{"method_slug":"pca","method_name":"PCA"}],"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":"stephenbeckr/SparsifiedKMeans","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"erickightley/sparseklearn","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":"2afd8310e05935ec8a3151efe192caa722fe03ed5b69ff0d6298b2519c42ce01","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}