{"doi":"10.7907/z9ht2m9c","title":"Unknown","abstract":null,"journal":null,"year":null,"id":681803,"datarank":0.5050943744979712,"base_score":3.367295829986474,"endowment":3.367295829986474,"self_citation_contribution":0.5050943744979712,"citation_network_contribution":0.0,"self_endowment_contribution":0.5050943744979712,"citer_contribution":0.0,"corpus_percentile":null,"corpus_rank":null,"citation_count":28,"citer_count":0,"citers_with_citation_signal":0,"citers_with_endowment":0,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[],"reference_count":0,"raw_metadata":{"has_enrichment":true,"resolved":true,"title":"Randomized Single-View Algorithms for Low-Rank Matrix Approximation","abstract":"This paper develops a suite of algorithms for constructing low-rank approximations of an input matrix from a random linear image of the matrix, called a sketch. These methods can preserve structural properties of the input matrix, such as positive-semidefiniteness, and they can produce approximations with a user-specified rank. The algorithms are simple, accurate, numerically stable, and provably correct. Moreover, each method is accompanied by an informative error bound that allows users to select parameters a priori to achieve a given approximation quality. These claims are supported by computer experiments.","is_dataset_classified":null,"base_score":3.367295829986474,"endowment":3.367295829986474,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"21097893","pmcid":null,"openalex_id":"https://openalex.org/W2508866287","authors":[],"funders":[],"total_grants":0,"fwci":null,"citation_percentile":null,"influential_citations":0,"citation_trend":[{"year":2016,"count":2},{"year":2017,"count":4},{"year":2018,"count":4},{"year":2019,"count":15},{"year":2020,"count":1},{"year":2021,"count":1},{"year":2022,"count":1}],"oa_status":"green","license":null,"oa_locations":[{"url":"https://authors.library.caltech.edu/74347/","host_type":"repository"},{"url":"http://infoscience.epfl.ch/record/221094","host_type":"repository"},{"url":"https://arxiv.org/pdf/1609.00048.pdf","host_type":"repository"},{"url":"https://doi.org/10.7907/z9ht2m9c","host_type":"repository"}],"fields_of_study":["Sparse and Compressive Sensing Techniques","Stochastic Gradient Optimization Techniques","Tensor decomposition and applications"],"mesh_terms":[],"keywords":["Rank (graph theory)","Matrix (chemical analysis)","Algorithm","A priori and a posteriori","Low-rank approximation","Sketch","Simple (philosophy)","Computer science","Approximation error","Approximation algorithm","Mathematics","Combinatorics"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-08-17T18:41:37.089987Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}