{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T16:11:43Z","timestamp":1775578303960,"version":"3.50.1"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/tsp.2022.3169896","type":"journal-article","created":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T20:36:04Z","timestamp":1650918964000},"page":"3000-3010","source":"Crossref","is-referenced-by-count":7,"title":["Multi-Weight Nuclear Norm Minimization for Low-Rank Matrix Recovery in Presence of Subspace Prior Information"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8348-6891","authenticated-orcid":false,"given":"Hamideh Sadat Fazael","family":"Ardakani","sequence":"first","affiliation":[{"name":"School of Electrical Engineering, Iran University of Science &amp; Technology, Tehran, Iran"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6866-6595","authenticated-orcid":false,"given":"Sajad","family":"Daei","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering, Iran University of Science &amp; Technology, Tehran, Iran"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9104-5428","authenticated-orcid":false,"given":"Farzan","family":"Haddadi","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering, Iran University of Science &amp; Technology, Tehran, Iran"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2015.2492960"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISBI.2010.5490076"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISBI.2010.5490156"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.105.150401"},{"key":"ref5","first-page":"2056","article-title":"Collaborative filtering in a non-uniform world: Learning with the weighted trace norm","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Srebro"},{"key":"ref6","article-title":"Netflix: The netflix prize","volume-title":"Proc. KDD Cup Workshop","author":"Bennett","year":"2007"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/130919210"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0040-1"},{"key":"ref10","article-title":"The netflix prize","volume-title":"Proc. KDD Cup Workshop","author":"Bennett","year":"2007"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2016.2535310"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.3019724"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2015.2508809"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2019.2934846"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2816685"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.5555\/2969442.2969475"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126536"},{"key":"ref18","article-title":"Provable inductive matrix completion","author":"Jain","year":"2013"},{"key":"ref19","first-page":"2301","article-title":"Speedup matrix completion with side information: Application to multi-label learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Xu"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2010.5531594"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.35"},{"key":"ref22","article-title":"A greedy algorithm for matrix recovery with subspace prior information","author":"Ardakani","year":"2019"},{"key":"ref23","article-title":"Optimal weighted low-rank matrix recovery with subspace prior information","author":"Daei"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2008.03.014"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2920640"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2940673"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iaw023"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2926790"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2008.081002"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3045272"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2937516"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2843783"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2855197"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/9675017\/09762550.pdf?arnumber=9762550","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T21:12:33Z","timestamp":1705957953000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9762550\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/tsp.2022.3169896","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}