{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T18:10:02Z","timestamp":1649009402938},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,11,29]],"date-time":"2017-11-29T00:00:00Z","timestamp":1511913600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s11227-017-2164-x","type":"journal-article","created":{"date-parts":[[2017,11,29]],"date-time":"2017-11-29T13:55:19Z","timestamp":1511963719000},"page":"830-844","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Low-rank approximation of large-scale matrices via randomized methods"],"prefix":"10.1007","volume":"74","author":[{"given":"Sarvenaz","family":"Hatamirad","sequence":"first","affiliation":[]},{"given":"Mir Mohsen","family":"Pedram","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,29]]},"reference":[{"key":"2164_CR1","volume-title":"Topics in randomized numerical linear algebra","author":"AA Gittens","year":"2013","unstructured":"Gittens AA (2013) Topics in randomized numerical linear algebra. California Institute of Technology, Pasadena"},{"issue":"2","key":"2164_CR2","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1137\/090771806","volume":"53","author":"N Halko","year":"2011","unstructured":"Halko N, Martinsson P-G, Tropp JA (2011) Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions. SIAM Rev 53(2):217\u2013288","journal-title":"SIAM Rev"},{"key":"2164_CR3","volume-title":"Randomized algorithms for low-rank matrix decomposition. Computer and information science","author":"BJ Sapp","year":"2011","unstructured":"Sapp BJ (2011) Randomized algorithms for low-rank matrix decomposition. Computer and information science. University of Pennsylvania, Philadelphia"},{"key":"2164_CR4","volume-title":"Randomized methods for computing low-rank approximations of matrices","author":"NP Halko","year":"2012","unstructured":"Halko NP (2012) Randomized methods for computing low-rank approximations of matrices. University of Colorado, Denver"},{"issue":"189\u2013206","key":"2164_CR5","first-page":"1","volume":"26","author":"WB Johnson","year":"1984","unstructured":"Johnson WB, Lindenstrauss J (1984) Extensions of Lipschitz mappings into a Hilbert space. Contemp Math 26(189\u2013206):1","journal-title":"Contemp Math"},{"issue":"2","key":"2164_CR6","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"EJ Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s EJ, Romberg J, Tao T (2006) Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans Inf Theory 52(2):489\u2013509","journal-title":"IEEE Trans Inf Theory"},{"issue":"4","key":"2164_CR7","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho DL (2006) Compressed sensing. IEEE Trans Inf Theory 52(4):1289\u20131306","journal-title":"IEEE Trans Inf Theory"},{"key":"2164_CR8","doi-asserted-by":"crossref","unstructured":"Papadimitriou CH, Tamaki H, Raghavan P, Vempala S (1998) Latent semantic indexing: a probabilistic analysis. In: Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, ACM","DOI":"10.1145\/275487.275505"},{"key":"2164_CR9","doi-asserted-by":"crossref","unstructured":"Ailon N, Chazelle B (2006) Approximate nearest neighbors and the fast Johnson\u2013Lindenstrauss transform. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, ACM","DOI":"10.1145\/1132516.1132597"},{"issue":"2","key":"2164_CR10","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/1646353.1646379","volume":"53","author":"N Ailon","year":"2010","unstructured":"Ailon N, Chazelle B (2010) Faster dimension reduction. Commun ACM 53(2):97\u2013104","journal-title":"Commun ACM"},{"key":"2164_CR11","doi-asserted-by":"crossref","unstructured":"Sarlos T (2006) Improved approximation algorithms for large matrices via random projections. In: Foundations of Computer Science, 2006. FOCS\u201906. 47th Annual IEEE Symposium on 2006, IEEE","DOI":"10.1109\/FOCS.2006.37"},{"issue":"3","key":"2164_CR12","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/j.acha.2007.12.002","volume":"25","author":"F Woolfe","year":"2008","unstructured":"Woolfe F, Liberty E, Rokhlin V, Tygert M (2008) A fast randomized algorithm for the approximation of matrices. Appl Comput Harmonic Anal 25(3):335\u2013366","journal-title":"Appl Comput Harmonic Anal"},{"issue":"2","key":"2164_CR13","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1002\/rsa.20218","volume":"33","author":"J Matouek","year":"2008","unstructured":"Matouek J (2008) On variants of the Johnson\u2013Lindenstrauss lemma. Random Struct Algorithms 33(2):142\u2013156","journal-title":"Random Struct Algorithms"},{"issue":"3","key":"2164_CR14","first-page":"21","volume":"9","author":"N Ailon","year":"2013","unstructured":"Ailon N, Liberty E (2013) An almost optimal unrestricted fast Johnson\u2013Lindenstrauss transform. ACM Trans Algorithms (TALG) 9(3):21","journal-title":"ACM Trans Algorithms (TALG)"},{"key":"2164_CR15","doi-asserted-by":"crossref","unstructured":"Venkatasubramanian S, Wang Q (2011) The Johnson\u2013Lindenstrauss transform: an empirical study. In: Proceedings of the Meeting on Algorithm Engineering & Experiments. Society for Industrial and Applied Mathematics","DOI":"10.1137\/1.9781611972917.16"},{"key":"2164_CR16","doi-asserted-by":"crossref","DOI":"10.1117\/3.890094","volume-title":"Hadamard transforms","author":"S Agaian","year":"2011","unstructured":"Agaian S, Sarukhanyan H, Egiazarian K, Astola J (2011) Hadamard transforms, 1st edn. SPIE Press, Bellingham","edition":"1"},{"issue":"1","key":"2164_CR17","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0166-218X(99)00182-1","volume":"101","author":"G-S Cheon","year":"2000","unstructured":"Cheon G-S, Shader BL (2000) Sparse orthogonal matrices and the Haar wavelet. Discrete Appl Math 101(1):63\u201376","journal-title":"Discrete Appl Math"},{"issue":"1","key":"2164_CR18","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0012-365X(03)00227-9","volume":"273","author":"N Alon","year":"2003","unstructured":"Alon N (2003) Problems and results in extremal combinatorics\u2014I. Discrete Math 273(1):31\u201353","journal-title":"Discrete Math"},{"key":"2164_CR19","doi-asserted-by":"crossref","unstructured":"Tropp JA (2015) An introduction to matrix concentration inequalities. Found Trends Mach Learn 8(1\u20132):1\u2013230","DOI":"10.1561\/2200000048"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-017-2164-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-017-2164-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-017-2164-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,7]],"date-time":"2019-10-07T02:48:13Z","timestamp":1570416493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-017-2164-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,29]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["2164"],"URL":"https:\/\/doi.org\/10.1007\/s11227-017-2164-x","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,29]]}}}