{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T02:54:09Z","timestamp":1730343249719,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.23919\/eusipco.2018.8553561","type":"proceedings-article","created":{"date-parts":[[2018,12,4]],"date-time":"2018-12-04T00:36:41Z","timestamp":1543883801000},"page":"2603-2607","source":"Crossref","is-referenced-by-count":3,"title":["Entry-wise Matrix Completion from Noisy Entries"],"prefix":"10.23919","author":[{"given":"Zahra","family":"Sabetsarvestani","sequence":"first","affiliation":[]},{"given":"Franz","family":"Kiraly","sequence":"additional","affiliation":[]},{"given":"R.","family":"Miguel","sequence":"additional","affiliation":[]},{"given":"D.","family":"Rodrigues","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref11","first-page":"937","article-title":"Guaranteed rank minimization via singular value projection","author":"meka","year":"2010","journal-title":"Advances in Neural Information Processing Systems 23"},{"key":"ref12","article-title":"A combinatorial algebraic approach for the identifiability of low-rank matrix completion","author":"kir\u00e1ly","year":"2012","journal-title":"Advances in Neural Information Processing Systems 23"},{"key":"ref13","first-page":"3413","article-title":"A simpler approach to matrix completion","volume":"12","author":"recht","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref15","first-page":"2057","article-title":"Matrix completion from noisy entries","volume":"11","author":"keshavan","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783259"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-005-4939-z"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref5","first-page":"25","article-title":"A spectral regularization framework for multi-task structure learning","author":"argyriou","year":"2007","journal-title":"Proceedings of the 20th International Conference on Neural Information Processing Systems ser NIPS'07"},{"key":"ref8","first-page":"1391","article-title":"The algebraic combinatorial approach for low-rank matrix completion","volume":"16","author":"kir\u00e1ly","year":"2015","journal-title":"Journal of Machine Learning Research"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0157257"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102441"},{"key":"ref9","first-page":"2364","author":"kiraly","year":"2013","journal-title":"Error-minimizing estimates and universal entry-wise error bounds for low-rank matrix completion"}],"event":{"name":"2018 26th European Signal Processing Conference (EUSIPCO)","start":{"date-parts":[[2018,9,3]]},"location":"Rome","end":{"date-parts":[[2018,9,7]]}},"container-title":["2018 26th European Signal Processing Conference (EUSIPCO)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8537458\/8552938\/08553561.pdf?arnumber=8553561","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T04:43:53Z","timestamp":1643258633000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8553561\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9]]},"references-count":15,"URL":"https:\/\/doi.org\/10.23919\/eusipco.2018.8553561","relation":{},"subject":[],"published":{"date-parts":[[2018,9]]}}}