{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T21:28:19Z","timestamp":1769549299261,"version":"3.49.0"},"reference-count":58,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2018AAA0101902"],"award-info":[{"award-number":["2018AAA0101902"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100017596","name":"Natural Science Basic Research Program of Shaanxi Program","doi-asserted-by":"publisher","award":["2021JM-071"],"award-info":[{"award-number":["2021JM-071"]}],"id":[{"id":"10.13039\/501100017596","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61936014"],"award-info":[{"award-number":["61936014"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772427"],"award-info":[{"award-number":["61772427"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["G2019KY0501"],"award-info":[{"award-number":["G2019KY0501"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cybern."],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1109\/tcyb.2021.3072896","type":"journal-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T19:48:51Z","timestamp":1623872931000},"page":"12042-12055","source":"Crossref","is-referenced-by-count":16,"title":["Robust Matrix Completion With Column Outliers"],"prefix":"10.1109","volume":"52","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0871-6519","authenticated-orcid":false,"given":"Feiping","family":"Nie","sequence":"first","affiliation":[{"name":"School of Computer Science and School of Artificial Intelligence, Optics and Electronics (iOPEN), Northwestern Polytechnical University, Xi’an, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3678-261X","authenticated-orcid":false,"given":"Ziheng","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science and School of Artificial Intelligence, Optics and Electronics (iOPEN), Northwestern Polytechnical University, Xi’an, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4874-4768","authenticated-orcid":false,"given":"Zhanxuan","family":"Hu","sequence":"additional","affiliation":[{"name":"School of Computer Science and School of Artificial Intelligence, Optics and Electronics (iOPEN), Northwestern Polytechnical University, Xi’an, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9240-6726","authenticated-orcid":false,"given":"Rong","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Cybersecurity and School of Artificial Intelligence, Optics and Electronics (iOPEN), Northwestern Polytechnical University, Xi’an, China"}]},{"given":"Xuelong","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science and School of Artificial Intelligence, Optics and Electronics (iOPEN), Northwestern Polytechnical University, Xi’an, China"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1329","article-title":"Maximum-margin matrix factorization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Srebro"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.101016\/j.cosrev.2016.11.001"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2351831"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2013.2272321"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2910151"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0306-5"},{"key":"ref9","volume-title":"The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices","author":"Lin","year":"2010"},{"issue":"3","key":"ref10","first-page":"615","article-title":"An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems","volume":"6","author":"Toh","year":"2010","journal-title":"Pac. J. Optim."},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2374695"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.3390\/math8081325"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2212015"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v26i1.8210"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/356"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6247927"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2817630"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-016-0930-5"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.3017672"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2677440"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2009.2018223"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-012-0044-1"},{"key":"ref23","first-page":"1412","article-title":"Scaled gradients on grassmann manifolds for matrix completion","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ngo"},{"key":"ref24","volume-title":"A gradient descent algorithm on the Grassman manifold for matrix completion","author":"Keshavan","year":"2009"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2937282"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2587825"},{"key":"ref27","first-page":"4152","article-title":"Fast algorithms for robust PCA via gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Yi"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6247828"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/358669.358692"},{"key":"ref30","first-page":"2080","article-title":"Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Wright"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173156"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.460"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2499247"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.04.032"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/BF01397471"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47969-4_47"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972733.4"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5706976"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/CAMSAP.2013.6713992"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6247848"},{"key":"ref41","first-page":"404","article-title":"Online robust PCA via stochastic optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Feng"},{"key":"ref42","first-page":"1718","article-title":"Online optimization for max-norm regularization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Shen"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2282910"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2417491"},{"key":"ref45","first-page":"4520","article-title":"Provable efficient online matrix completion via non-convex stochastic gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Jin"},{"key":"ref46","volume-title":"Convergence of a Grassmannian gradient descent algorithm for subspace estimation from undersampled data","author":"Zhang","year":"2016"},{"issue":"66","key":"ref47","first-page":"1957","article-title":"Practical approaches to principal component analysis in the presence of missing values","volume":"11","author":"Ilin","year":"2010","journal-title":"J. Mach. Learn. Res."},{"key":"ref48","first-page":"1062","article-title":"Optimal mean robust principal component analysis","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Nie"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.3027968"},{"key":"ref50","article-title":"Handling missing data in high-dimensional subspace modeling","author":"Balzano","year":"2012"},{"key":"ref51","first-page":"1813","article-title":"Efficient and robust feature selection via joint \u2113\u2082,\u2081-norms minimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Nie"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2014.2380155"},{"key":"ref53","volume-title":"Online robust subspace tracking from partial information","author":"He","year":"2011"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2015.08.003"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.02.026"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2858249"},{"issue":"2","key":"ref57","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1023\/A:1011419012209","article-title":"Eigentaste: A constant time collaborative filtering algorithm","volume":"4","author":"Goldberg","year":"2001","journal-title":"Inf. Retrieval J."},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/312624.312682"}],"container-title":["IEEE Transactions on Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6221036\/9920527\/09457222.pdf?arnumber=9457222","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T22:56:50Z","timestamp":1705013810000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9457222\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11]]},"references-count":58,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tcyb.2021.3072896","relation":{},"ISSN":["2168-2267","2168-2275"],"issn-type":[{"value":"2168-2267","type":"print"},{"value":"2168-2275","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11]]}}}