{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T16:17:21Z","timestamp":1782404241607,"version":"3.54.5"},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1713208"],"award-info":[{"award-number":["U1713208"]}],"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":["61672287"],"award-info":[{"award-number":["61672287"]}],"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":["61602244"],"award-info":[{"award-number":["61602244"]}],"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":["91420201"],"award-info":[{"award-number":["91420201"]}],"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":["61472187"],"award-info":[{"award-number":["61472187"]}],"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":["61572241"],"award-info":[{"award-number":["61572241"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LQ18F030014"],"award-info":[{"award-number":["LQ18F030014"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"crossref","award":["2014CB349303"],"award-info":[{"award-number":["2014CB349303"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Innovation Foundation from the Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of the Ministry of Education","award":["JYB201706"],"award-info":[{"award-number":["JYB201706"]}]},{"DOI":"10.13039\/501100004100","name":"Labex","doi-asserted-by":"publisher","award":["ANR-11-IDEX-0004-02"],"award-info":[{"award-number":["ANR-11-IDEX-0004-02"]}],"id":[{"id":"10.13039\/501100004100","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1109\/tnnls.2018.2851957","type":"journal-article","created":{"date-parts":[[2018,7,26]],"date-time":"2018-07-26T18:51:45Z","timestamp":1532631105000},"page":"803-817","source":"Crossref","is-referenced-by-count":44,"title":["A Fast and Accurate Matrix Completion Method Based on QR Decomposition and <inline-formula> \n                     <tex-math notation=\"LaTeX\">$L_{2,1}$ <\/tex-math>\n                  <\/inline-formula>-Norm Minimization"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6397-0889","authenticated-orcid":false,"given":"Qing","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8587-6997","authenticated-orcid":false,"given":"Franck","family":"Davoine","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4800-832X","authenticated-orcid":false,"given":"Jian","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ying","family":"Cui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4293-0869","authenticated-orcid":false,"given":"Zhong","family":"Jin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fei","family":"Han","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","first-page":"663","article-title":"Robust subspace segmentation by low-rank representation","author":"liu","year":"2010","journal-title":"Proc 27th Int Conf Mach Learn"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2013.2272642"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.15"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2012.07.003"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-012-0044-1"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"ref37","first-page":"1813","article-title":"Efficient and robust feature selection via joint \n$L_{2,1}$\n-norms minimization","author":"nie","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref36","first-page":"655","article-title":"Low-rank matrix recovery via efficient schatten p-norm minimization","author":"nie","year":"2012","journal-title":"Proc 26th AAAI Conf Artif Intell"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.160"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806506"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.271"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.366"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896304782"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2015.2421309"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2014.2363734"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/978-3-319-53547-0_3","article-title":"Fast nonnegative matrix factorization and completion using Nesterov iterations","author":"dorffer","year":"2017","journal-title":"Proc Int Conf Latent Variable Anal Signal Separat"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref21","article-title":"Matrix Rank Minimization with Applications","author":"fazel","year":"2002"},{"key":"ref24","first-page":"615","article-title":"An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems","volume":"6","author":"toh","year":"2010","journal-title":"Pacific J Optim"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2015.2511584"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0713-z"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1137\/0613074"},{"key":"ref51","author":"godfrey","year":"2006","journal-title":"Simple SVD Version 1 0"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2611525"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2766160"},{"key":"ref53","first-page":"1062","article-title":"Optimal mean robust principal component analysis","author":"nie","year":"2014","journal-title":"Proc 31st Int Conf Mach Learn"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2014.2359798"},{"key":"ref10","first-page":"424","article-title":"Robust discrete matrix completion","author":"huang","year":"2012","journal-title":"Proc 27th AAAI Conf Artif Intell"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2301139"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2014.2306063"},{"key":"ref12","first-page":"1202","article-title":"Joint low-rank representation and matrix completion under a singular value thresholding framework","author":"tzagkarakis","year":"2014","journal-title":"Proc 22nd Eur Signal Process Conf"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2009.2018223"},{"key":"ref14","first-page":"1","article-title":"Weighted low-rank approximations","author":"srebro","year":"2003","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.06.005"},{"key":"ref16","first-page":"179","article-title":"Top-N recommender system via matrix completion","author":"kang","year":"2016","journal-title":"Proc 30th AAAI Conf Artif Intell"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.309"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.02.026"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972764.58"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2015.2503238"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2343234"},{"key":"ref6","first-page":"1","article-title":"Generalized singular value thresholding","author":"lu","year":"2015","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2015.2446943"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2415195"},{"key":"ref7","first-page":"46","article-title":"Robust and scalable matrix completion","author":"kang","year":"2016","journal-title":"Proc Int Conf Big Data Smart Comput"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1137\/0911052"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LGRS.2015.2477854"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2777489"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2690970"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1137\/0702016"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2828699"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2472284"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2454521"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2553155"},{"key":"ref43","first-page":"575","article-title":"Nuclear norm minimization via active subspace selection","author":"hsieh","year":"2014","journal-title":"Proc 31st Int Conf Mach Learn"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/8645834\/08421060.pdf?arnumber=8421060","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:05:29Z","timestamp":1657746329000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8421060\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":55,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2018.2851957","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3]]}}}