{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:47:09Z","timestamp":1730274429409,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/isit.2010.5513563","type":"proceedings-article","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T19:57:25Z","timestamp":1282247845000},"page":"1503-1507","source":"Crossref","is-referenced-by-count":7,"title":["Regularization for matrix completion"],"prefix":"10.1109","author":[{"given":"Raghunandan H.","family":"Keshavan","sequence":"first","affiliation":[]},{"given":"Andrea","family":"Montanari","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1198\/jasa.2009.0121"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1214\/08-AOP394"},{"key":"ref12","article-title":"A gradient descent algorithm on the grass-mann manifold for matrix completion","author":"keshavan","year":"2009","journal-title":"arXiv 0910 5260"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1214\/009117906000001079"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1006\/jmva.1995.1051"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513563"},{"journal-title":"arXiv 0906 2027","article-title":"Matrix completion from noisy entries","year":"2009","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102441"},{"key":"ref5","article-title":"Maximum margin matrix factorization","volume":"17","author":"srebro","year":"2005","journal-title":"Advances in neural information processing systems"},{"key":"ref8","article-title":"Matrix completion with noise","author":"cand\u00e8s","year":"2009","journal-title":"arXiv 0903 3131"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205567"},{"year":"0","key":"ref1","article-title":"Netflix prize"},{"article-title":"Spectral regularization algorithms for learning large incomplete matrices","year":"2009","author":"mazumder","key":"ref9"}],"event":{"name":"2010 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2010,6,13]]},"location":"Austin, TX, USA","end":{"date-parts":[[2010,6,18]]}},"container-title":["2010 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5508195\/5513230\/05513563.pdf?arnumber=5513563","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T21:08:40Z","timestamp":1489871320000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5513563\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2010.5513563","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}