{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T21:05:53Z","timestamp":1780607153434,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,10,22]],"date-time":"2018-10-22T00:00:00Z","timestamp":1540166400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Natural Science Basic Research Plan in Shaanxi Province of China","award":["2017JM1001"],"award-info":[{"award-number":["2017JM1001"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,10,22]]},"DOI":"10.1145\/3207677.3278070","type":"proceedings-article","created":{"date-parts":[[2018,10,18]],"date-time":"2018-10-18T10:19:29Z","timestamp":1539857969000},"page":"1-5","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Randomized Method for Robust Principal Component Analysis"],"prefix":"10.1145","author":[{"given":"Sanyang","family":"Liu","sequence":"first","affiliation":[{"name":"Xidian University, Shaanxi, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chong","family":"Zhang","sequence":"additional","affiliation":[{"name":"Xidian University, Shaanxi, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,10,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.290.5500.2319"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02288367"},{"issue":"100","key":"e_1_3_2_1_3_1","first-page":"513","article-title":"Principal component analysis","volume":"87","author":"Jolliffe Lan T.","year":"2011","unstructured":"Lan T. Jolliffe. 2011. Principal component analysis. Journal of Marketing Research, 87(100), 513.","journal-title":"Journal of Marketing Research"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","unstructured":"J. Wright A. Ganesh S. Rao and Y. Ma. 2009. Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Matrices. In Proceeding of Advances in Neural Information Processing Systems 87(4) 20:3--20:56.","DOI":"10.5555\/2984093.2984326"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2018.2826566"},{"issue":"3","key":"e_1_3_2_1_6_1","first-page":"707","article-title":"Fast convex optimization algorithms for exact recovery of a corrupted low-rank matrix","volume":"56","author":"Lin Z.","year":"2009","unstructured":"Z. Lin, A. Ganesh, J. Wright, L. Wu, M. Chen, and Y. Ma. 2009. Fast convex optimization algorithms for exact recovery of a corrupted low-rank matrix. Journal of the Marine Biological Association of the Uk, 56(3), 707--722.","journal-title":"Journal of the Marine Biological Association of the Uk"},{"key":"e_1_3_2_1_7_1","unstructured":"Z. Lin M. Chen and Y. Ma. 2009. The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices. Eprint Arxiv 9."},{"key":"e_1_3_2_1_8_1","unstructured":"X. Yuan and J. Yang. 2009. Sparse and low rank matrix decomposition via alternating direction method. Pacific Journal of Optimization 9(1)."},{"key":"e_1_3_2_1_9_1","volume-title":"Proceeding of IEEE Conference on Computer Vision and Pattern Recognition (CVPR)","author":"Oh Tae H.","year":"2015","unstructured":"Tae H. Oh, Y. Matsushita, Yu W. Tai, and In S. Kweon. 2015. Fast randomized singular value thresholding for nuclear norm minimization. In Proceeding of IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2015."},{"key":"e_1_3_2_1_10_1","unstructured":"Y. Li W. Yu. 2017. A Fast Implementation of Singular Value Thresholding Algorithm using Recycling Rank Revealing Randomized Singular Value Decomposition. arXiv preprint arXiv:1704.05528."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"V. Rokhlin A. Szlam and M. Tygert. 2009. A Randomized Algorithm for Principal Component Analysis. Siam Journal on Matrix Analysis and Applications 31(3).","DOI":"10.1137\/080736417"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2016.11.001"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.3934\/bdia.2016001"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/2986459.2986528"},{"key":"e_1_3_2_1_16_1","series-title":"SIAM Journal on Optimization, 20","volume-title":"A singular value thresholding algorithm for matrix completion","author":"Cai J.","year":"2010","unstructured":"J. Cai, E. Cand\u00e8s and Z. Shen. A singular value thresholding algorithm for matrix completion. SIAM Journal on Optimization, 20 (2010), 1956--1982."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488620"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000035"},{"key":"e_1_3_2_1_19_1","unstructured":"Per G. Martinsson. 2016. Randomized methods for matrix computations. arXiv preprint arXiv:1607.01649."},{"key":"e_1_3_2_1_20_1","volume-title":"Technical Report 1361, Department of Computer Science","author":"Martinsson Per G.","year":"2006","unstructured":"Per G. Martinsson, V. Rokhlin, and M. Tygert. 2006. A randomized algorithm for the approximation of matrices. Technical Report 1361, Department of Computer Science, Yale University, New Haven, CT."},{"key":"e_1_3_2_1_21_1","unstructured":"M.Hached and K. Jbilou. 2018. Numerical methods for differential linear matrix equations via Krylov subspace methods. arXiv preprint arXiv:1805.10192."}],"event":{"name":"CSAE '18: The 2nd International Conference on Computer Science and Application Engineering","location":"Hohhot China","acronym":"CSAE '18"},"container-title":["Proceedings of the 2nd International Conference on Computer Science and Application Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3207677.3278070","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3207677.3278070","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T20:43:54Z","timestamp":1780605834000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3207677.3278070"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,22]]},"references-count":21,"alternative-id":["10.1145\/3207677.3278070","10.1145\/3207677"],"URL":"https:\/\/doi.org\/10.1145\/3207677.3278070","relation":{},"subject":[],"published":{"date-parts":[[2018,10,22]]},"assertion":[{"value":"2018-10-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}