{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T11:10:07Z","timestamp":1780485007679,"version":"3.54.1"},"reference-count":58,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"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. Knowl. Data Eng."],"published-print":{"date-parts":[[2020,2,1]]},"DOI":"10.1109\/tkde.2018.2882197","type":"journal-article","created":{"date-parts":[[2018,11,19]],"date-time":"2018-11-19T19:38:11Z","timestamp":1542656291000},"page":"288-301","source":"Crossref","is-referenced-by-count":5,"title":["Fast and Low Memory Cost Matrix Factorization: Algorithm, Analysis, and Case Study"],"prefix":"10.1109","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9108-6767","authenticated-orcid":false,"given":"Yan","family":"Yan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8856-756X","authenticated-orcid":false,"given":"Mingkui","family":"Tan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ivor W.","family":"Tsang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0512-880X","authenticated-orcid":false,"given":"Yi","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qinfeng","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5715-7154","authenticated-orcid":false,"given":"Chengqi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","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":"ref38","first-page":"43","article-title":"Collaborative filtering via ensembles of matrix factorizations","author":"wu","year":"2007","journal-title":"Proc KDD Cup Workshop"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/15M1050525"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5706976"},{"key":"ref30","article-title":"A riemannian geometry for low-rank matrix completion","volume":"abs 1211 1550","author":"mishra","year":"2012","journal-title":"CoRR"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143876"},{"key":"ref36","first-page":"389","article-title":"Collaborative filtering on a budget","author":"karatzoglou","year":"2010","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref35","first-page":"1593","article-title":"Maximum margin matrix factorization for collaborative ranking","author":"weimer","year":"2007","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-008-5073-7"},{"key":"ref28","first-page":"406","article-title":"RTRMC: A Riemannian trust-region method for low-rank matrix completion","author":"boumal","year":"2011","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1515\/9781400830244"},{"key":"ref29","first-page":"542","article-title":"Linear regression under fixed-rank constraints: A Riemannian approach","author":"meyer","year":"2011","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2415497"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2535367"},{"key":"ref20","first-page":"ii-1539","article-title":"Riemannian pursuit for big matrix recovery","author":"tan","year":"2014","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/110845768"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref24","first-page":"1412","article-title":"Scaled gradients on Grassmann manifolds for matrix completion","author":"ngo","year":"2012","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-012-0044-1"},{"key":"ref26","first-page":"64","article-title":"Nonparametric max-margin matrix factorization for collaborative prediction","author":"xu","year":"2012","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref25","first-page":"406","article-title":"RTRMC: A Riemannian trust-region method for low-rank matrix completion","author":"boumal","year":"2012","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref51","article-title":"The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices","author":"lin","year":"2010","journal-title":"Arxiv preprint arXiv 1009 5055"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/1401132.1401174"},{"key":"ref57","first-page":"3","article-title":"The Yahoo! music dataset and KDD-Cup'11","author":"dror","year":"2012","journal-title":"Proc JMLR Workshop Conf Proc"},{"key":"ref56","first-page":"3","article-title":"The netflix prize","author":"bennett","year":"2007","journal-title":"Proc KDD Cup Workshop"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/312624.312682"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/2668133"},{"key":"ref53","article-title":"Nonlinear optimization","author":"hinterm\u00fcller","year":"2010","journal-title":"Vorlesungsskript Universität Berlin"},{"key":"ref52","first-page":"3988","article-title":"Scalable maximum margin matrix factorization by active Riemannian subspace search","author":"yan","year":"2015","journal-title":"Proc Int Conf Artif Intell"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2465956"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2014.2323404"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2012.700713"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.282"},{"key":"ref13","article-title":"Matrix rank minimization with applications","author":"fazel","year":"2002"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref17","first-page":"615","article-title":"An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems","volume":"6","author":"toh","year":"2010","journal-title":"Pacific J Optimization"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102441"},{"key":"ref19","first-page":"1257","article-title":"Probabilistic matrix factorization","author":"mnih","year":"2007","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2441716"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2399298"},{"key":"ref6","first-page":"1329","article-title":"Maximum-margin matrix factorization","author":"srebro","year":"2005","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2016.2602938"},{"key":"ref8","article-title":"Is matching pursuit solving convex problems?","volume":"abs 1302 5010","author":"tan","year":"2013","journal-title":"CoRR"},{"key":"ref7","first-page":"iii-978","article-title":"Fast max-margin matrix factorization with data augmentation","author":"xu","year":"2013","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref49","first-page":"703","article-title":"Robust photometric stereo via low-rank matrix completion and recovery","author":"wu","year":"2010","journal-title":"Proc Asian Conf Comput Vis"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2361338"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2017.2659221"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2013.2281420"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539849"},{"key":"ref42","first-page":"1233","article-title":"No spurious local minima in nonconvex low rank problems: A unified geometric analysis","volume":"70","author":"ge","year":"2017","journal-title":"Proc 34th Int Conf Mach Learn"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/110859646"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2910585"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2605687"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8956008\/08540438.pdf?arnumber=8540438","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T14:41:37Z","timestamp":1651070497000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8540438\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,1]]},"references-count":58,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2018.2882197","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,1]]}}}