{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,19]],"date-time":"2026-09-19T03:35:27Z","timestamp":1789788927831,"version":"4.0.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642387081","type":"print"},{"value":"9783642387098","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40991-2_13","type":"book-chapter","created":{"date-parts":[[2013,8,28]],"date-time":"2013-08-28T01:43:57Z","timestamp":1377654237000},"page":"194-209","source":"Crossref","is-referenced-by-count":11,"title":["Noisy Matrix Completion Using Alternating Minimization"],"prefix":"10.1007","author":[{"given":"Suriya","family":"Gunasekar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ayan","family":"Acharya","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Neeraj","family":"Gaur","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joydeep","family":"Ghosh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Bertalmio, M., Vese, L., Sapiro, G., Osher, S.: Simultaneous structure and texture image inpainting. IEEE Transactions on Image Processing (2003)","DOI":"10.1109\/TIP.2003.815261"},{"key":"13_CR2","unstructured":"Cand\u00e8s, E.J., Plan, Y.: Matrix completion with noise. CoRR (2009)"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Foundations of Computational Mathematics (2009)","DOI":"10.1007\/s10208-009-9045-5"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Cand\u00e8s, E.J., Tao, T.: The power of convex relaxation: near-optimal matrix completion. IEEE Transactions on Information Theory (2010)","DOI":"10.1109\/TIT.2010.2044061"},{"key":"13_CR5","unstructured":"Golub, G.H., van Van Loan, C.F.: Matrix Computations (Johns Hopkins Studies in Mathematical Sciences), 3rd edn. The Johns Hopkins University Press (1996)"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Jain, P., Netrapalli, P., Sanghavi, S.: Low-rank matrix completion using alternating minimization. ArXiv e-prints (December 2012)","DOI":"10.1145\/2488608.2488693"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Jain, P., Netrapalli, P., Sanghavi, S.: Low-rank matrix completion using alternating minimization. In: STOC (2013)","DOI":"10.1145\/2488608.2488693"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Keshavan, R.H., Montanari, A., Oh, S.: Matrix completion from a few entries. IEEE Transactions on Information Theory (2010)","DOI":"10.1109\/ISIT.2009.5205567"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Keshavan, R.H., Montanari, A., Oh, S.: Matrix completion from noisy entries. JMLR (2010)","DOI":"10.1109\/ISIT.2009.5205567"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Koren, Y., Bell, R., Volinsky, C.: Matrix factorization techniques for recommender systems. IEEE Computer (2009)","DOI":"10.1109\/MC.2009.263"},{"key":"13_CR11","unstructured":"Mitra, K., Sheorey, S., Chellappa, R.: Large-scale matrix factorization with missing data under additional constraints. In: NIPS (2010)"},{"key":"13_CR12","unstructured":"So, A.M.C., Ye, Y.: Theory of semidefinite programming for sensor network localization. In: ACM-SIAM Symposium on Discrete Algorithms (2005)"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Tak\u00e1cs, G., Pil\u00e1szy, I., N\u00e9meth, B., Tikk, D.: Investigation of various matrix factorization methods for large recommender systems. In: KDD Workshop on Large-Scale Recommender Systems and the Netflix Prize Competition (2008)","DOI":"10.1109\/ICDMW.2008.86"},{"key":"13_CR14","unstructured":"Wang, Y., Xu, H.: Stability of matrix factorization for collaborative filtering. In: ICML (2012)"},{"key":"13_CR15","unstructured":"Yu, K., Tresp, V.: Learning to learn and collaborative filtering. In: NIPS Workshop on Inductive Transfer: 10 Years Later (2005)"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-68880-8_32","volume-title":"Algorithmic Aspects in Information and Management","author":"Y. Zhou","year":"2008","unstructured":"Zhou, Y., Wilkinson, D., Schreiber, R., Pan, R.: Large-scale parallel collaborative filtering for the netflix prize. In: Fleischer, R., Xu, J. (eds.) AAIM 2008. LNCS, vol.\u00a05034, pp. 337\u2013348. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40991-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T19:45:26Z","timestamp":1558035926000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40991-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387081","9783642387098"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40991-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}