{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T22:09:04Z","timestamp":1778537344432,"version":"3.51.4"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"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":["61601112"],"award-info":[{"award-number":["61601112"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Hong Kong Special Administrative Region, China","award":["9220083"],"award-info":[{"award-number":["9220083"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Big Data"],"published-print":{"date-parts":[[2020,3,1]]},"DOI":"10.1109\/tbdata.2018.2871476","type":"journal-article","created":{"date-parts":[[2018,9,20]],"date-time":"2018-09-20T18:45:35Z","timestamp":1537469135000},"page":"119-130","source":"Crossref","is-referenced-by-count":15,"title":["Matrix Completion via Sparse Factorization Solved by Accelerated Proximal Alternating Linearized Minimization"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9665-0355","authenticated-orcid":false,"given":"Jicong","family":"Fan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0381-4360","authenticated-orcid":false,"given":"Mingbo","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7051-0434","authenticated-orcid":false,"given":"Tommy W.S.","family":"Chow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","article-title":"Variants of alternating minimization method with sublinear rates of convergence for convex optimization","author":"zhang","year":"2014"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/13094829X"},{"key":"ref33","first-page":"2463","article-title":"Sparse subspace clustering with missing entries","volume":"37","author":"yang","year":"2015","journal-title":"Proc 32nd Int Conf Mach Learn"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2017.04.005"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.88"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.57"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0701-9"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2017.05.013"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2586753"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2613070"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2013.03.012"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2016.2541167"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2016.2555318"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2016.2602849"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.271"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.526"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2015.2503238"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2017.10.014"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2015.2421309"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2343234"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2010.939739"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2499247"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2016.2585047"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-016-0736-y"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2598574"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref5","first-page":"1881","article-title":"Universal matrix completion","author":"bhojanapalli","year":"2014","journal-title":"Proc 31st Int Conf Mach Learn"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2017.10.007"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.05.074"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/110845768"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"ref20","article-title":"Learning with matrix factorizations","author":"srebro","year":"2004"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011419012209"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.7146\/dpb.v27i537.7070"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-012-0044-1"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-57529-2_11"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2008.09.002"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref24","article-title":"The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices","author":"lin","year":"2010"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1561\/2400000003"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/16M1055323"},{"key":"ref26","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":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-015-0746-4"},{"key":"ref25","first-page":"1805","article-title":"Generalized singular value thresholding","author":"lu","year":"2015","journal-title":"Proc 29th AAAI Conf Artif Intell"}],"container-title":["IEEE Transactions on Big Data"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6687317\/9016413\/08469061.pdf?arnumber=8469061","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:32:18Z","timestamp":1651080738000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8469061\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,1]]},"references-count":48,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tbdata.2018.2871476","relation":{},"ISSN":["2332-7790","2372-2096"],"issn-type":[{"value":"2332-7790","type":"electronic"},{"value":"2372-2096","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,1]]}}}