{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T18:32:26Z","timestamp":1770748346723,"version":"3.49.0"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"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":["61622305"],"award-info":[{"award-number":["61622305"]}],"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":["61532009"],"award-info":[{"award-number":["61532009"]}],"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":["61725203"],"award-info":[{"award-number":["61725203"]}],"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":["71490725"],"award-info":[{"award-number":["71490725"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Foundation of Jiangsu Province of China","award":["BK20160040"],"award-info":[{"award-number":["BK20160040"]}]},{"name":"SenseTime Research Fund"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2021,2,1]]},"DOI":"10.1109\/tpami.2019.2937869","type":"journal-article","created":{"date-parts":[[2019,8,27]],"date-time":"2019-08-27T20:49:40Z","timestamp":1566938980000},"page":"549-566","source":"Crossref","is-referenced-by-count":17,"title":["Matrix Completion with Deterministic Sampling: Theories and Methods"],"prefix":"10.1109","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9428-4387","authenticated-orcid":false,"given":"Guangcan","family":"Liu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5512-6984","authenticated-orcid":false,"given":"Qingshan","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Xiao-Tong","family":"Yuan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3094-7735","authenticated-orcid":false,"given":"Meng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/0117004"},{"key":"ref33","first-page":"926","article-title":"A unified convex surrogate for the schatten-p norm","author":"xu","year":"2017","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref32","first-page":"2016","article-title":"Scalable algorithms for tractable schatten quasi-norm minimization","author":"shang","year":"2016","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2008.4739332"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0030287"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0701-9"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0133-5"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2014.2362055"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173156"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2598574"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.88"},{"key":"ref15","first-page":"1107","article-title":"Non-convex robust PCA","author":"netrapalli","year":"2014","journal-title":"Proc 27th Int Conf Neural Inf Process Syst"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2453969"},{"key":"ref17","first-page":"559","article-title":"A nonconvex optimization framework for low rank matrix estimation","author":"zhao","year":"2015","journal-title":"Proc 28th Int Conf Neural Inf Process Syst"},{"key":"ref18","first-page":"2973","article-title":"Matrix completion has no spurious local minimum","author":"ge","year":"2016","journal-title":"Proc 30th Int Conf Neural Inf Process Syst"},{"key":"ref19","first-page":"2056","article-title":"Collaborative filtering in a non-uniform world: Learning with the weighted trace norm","author":"salakhutdinov","year":"2010","journal-title":"Proc 23rd Int Conf Neural Inf Process Syst"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0437847100"},{"key":"ref4","first-page":"2287","article-title":"Spectral regularization algorithms for learning large incomplete matrices","volume":"11","author":"mazumder","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513471"},{"key":"ref27","article-title":"When is missing data recoverable?","author":"zhang","year":"2006"},{"key":"ref6","first-page":"2762","article-title":"Deterministic symmetric positive semidefinite matrix completion","author":"bishop","year":"2014","journal-title":"Proc 27th Int Conf Neural Inf Process Syst"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2586753"},{"key":"ref5","first-page":"836","article-title":"Low-rank matrix and tensor completion via adaptive sampling","author":"krishnamurthy","year":"2013","journal-title":"Proc 26th Int Conf Neural Inf Process Syst"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref7","first-page":"2057","article-title":"Matrix completion from noisy entries","volume":"11","author":"keshavan","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref9","first-page":"1781","article-title":"Matrix completion from any given set of observations","author":"lee","year":"2013","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref20","first-page":"1258","article-title":"Matrix completion from power-law distributed samples","author":"meka","year":"2009","journal-title":"Proc 22nd Int Conf Neural Inf Process Syst"},{"key":"ref22","first-page":"1391","article-title":"The algebraic combinatorial approach for low-rank matrix completion","volume":"16","author":"kir\u00e1ly","year":"2015","journal-title":"J Mach Learn Res"},{"key":"ref21","first-page":"2056","article-title":"A combinatorial algebraic approach for the identi ability of low-rank matrix completion","author":"kir\u00e1ly","year":"2012","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref42","first-page":"1410","article-title":"Practical low-rank matrix approximation under robust L1-norm","author":"zheng","year":"2012","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref24","first-page":"2999","article-title":"Completing any low-rank matrix, provably","volume":"16","author":"chen","year":"2015","journal-title":"J Mach Learn Res"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2415195"},{"key":"ref23","first-page":"1665","article-title":"Restricted strong convexity and weighted matrix completion: Optimal bounds with noise","volume":"13","author":"negahban","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref26","first-page":"785","article-title":"A new theory for matrix completion","author":"liu","year":"2017","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref43","first-page":"1901","article-title":"The movielens datasets: History and context","volume":"5","author":"harper","year":"2015","journal-title":"ACM Transactions on Interactive Intelligent Systems"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2016.2537145"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/9317867\/08815944.pdf?arnumber=8815944","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:49:20Z","timestamp":1652194160000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8815944\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,1]]},"references-count":43,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2019.2937869","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"},{"value":"1939-3539","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,1]]}}}