{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T14:27:15Z","timestamp":1780410435098,"version":"3.54.1"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"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":["61871470"],"award-info":[{"award-number":["61871470"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2023,2,1]]},"DOI":"10.1109\/tpami.2022.3157083","type":"journal-article","created":{"date-parts":[[2022,3,7]],"date-time":"2022-03-07T20:52:47Z","timestamp":1646686367000},"page":"1981-1991","source":"Crossref","is-referenced-by-count":28,"title":["Matrix Completion via Non-Convex Relaxation and Adaptive Correlation Learning"],"prefix":"10.1109","volume":"45","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2924-946X","authenticated-orcid":false,"given":"Xuelong","family":"Li","sequence":"first","affiliation":[{"name":"School of Artificial Intelligence, OPtics and ElectroNics (iOPEN), Northwestern Polytechnical University, Xi&#x0027;an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4274-7332","authenticated-orcid":false,"given":"Hongyuan","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence, OPtics and ElectroNics (iOPEN), Northwestern Polytechnical University, Xi&#x0027;an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9418-0863","authenticated-orcid":false,"given":"Rui","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence, OPtics and ElectroNics (iOPEN), Northwestern Polytechnical University, Xi&#x0027;an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","first-page":"41","article-title":"Multi-task feature learning","author":"argyriou","year":"2006","journal-title":"Proc 20th Annu Conf Neural Inf Process Syst"},{"key":"ref35","article-title":"A survey on matrix completion: Perspective of signal processing","author":"li","year":"2019"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/090763184"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2014.02.015"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.271"},{"key":"ref37","first-page":"612","article-title":"Linearized alternating direction method with adaptive penalty for low-rank representation","author":"lin","year":"2011","journal-title":"Proc 24th Int Conf Neural Inf Process Syst"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.3007637"},{"key":"ref36","article-title":"The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices","author":"lin","year":"2010"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2613070"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2586753"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2853589"},{"key":"ref33","first-page":"1813","article-title":"Efficient and robust feature selection via joint L2, 1-norms minimization","author":"nie","year":"2010","journal-title":"Proc 23rd Int Conf Neural Inf Process Syst"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.567"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref2","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":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2006.881199"},{"key":"ref17","first-page":"1033","article-title":"Fast image deconvolution using hyper-laplacian priors","author":"krishnan","year":"2009","journal-title":"Proc 22nd Int Conf Neural Inf Process Syst"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/11503415_37"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-016-0930-5"},{"key":"ref38","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":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.34"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1109\/TNNLS.2012.2197412","article-title":"$l\\_\\lbrace 1\/2\\rbrace$l_{1\/2} regularization: A thresholding representation theory and a fast solver","volume":"23","author":"xu","year":"2012","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"ref24","first-page":"1410","article-title":"Practical low-rank matrix approximation under robust L 1-norm","author":"zheng","year":"2012","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref23","first-page":"2056","article-title":"Collaborative filtering in a non-uniform world: Learning with the weighted trace norm","author":"srebro","year":"2010","journal-title":"Proc 23rd Int Conf Neural Inf Process Syst"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2748590"},{"key":"ref25","first-page":"5105","article-title":"Factor group-sparse regularization for efficient low-rank matrix recovery","author":"fan","year":"2019","journal-title":"Proc 33rd Int Conf Neural Inf Process Syst"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2018.2886712"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.57"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.167"},{"key":"ref22","first-page":"1329","article-title":"Maximum-margin matrix factorization","author":"srebro","year":"2005","journal-title":"Proc 17th Int Conf Neural Inf Process Syst"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1198\/016214501753382273"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.148"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3008050"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2356461"},{"key":"ref29","first-page":"2107","article-title":"Collaborative filtering with graph information: Consistency and scalable methods","author":"rao","year":"2015","journal-title":"Proc 28th Int Conf Neural Inf Process Syst"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.26599\/BDMA.2018.9020008"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/344779.344972"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2012.6503914"},{"key":"ref6","first-page":"2192","article-title":"Matrix completion by truncated nuclear norm regularization","author":"zhang","year":"2012","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref40","author":"chung","year":"1997","journal-title":"Spectral Graph Theory"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/10008914\/09729616.pdf?arnumber=9729616","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T19:46:35Z","timestamp":1675107995000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9729616\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,1]]},"references-count":44,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2022.3157083","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":[[2023,2,1]]}}}