{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T20:36:28Z","timestamp":1774470988448,"version":"3.50.1"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003968","name":"Iran National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003968","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Deputy of Sharif University of Technology"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Signal Process. Lett."],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1109\/lsp.2019.2891134","type":"journal-article","created":{"date-parts":[[2019,1,9]],"date-time":"2019-01-09T00:42:01Z","timestamp":1546994521000},"page":"337-341","source":"Crossref","is-referenced-by-count":27,"title":["A Novel Approach to Quantized Matrix Completion Using Huber Loss Measure"],"prefix":"10.1109","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7532-1325","authenticated-orcid":false,"given":"Ashkan","family":"Esmaeili","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4635-8986","authenticated-orcid":false,"given":"Farokh","family":"Marvasti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"426","article-title":"Optimal statistical and computational rates for one bit matrix completion","author":"ni","year":"0","journal-title":"Proc Artif Intell Statist"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2014.6854548"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2015.7421187"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CAMSAP.2015.7383813"},{"key":"ref14","article-title":"Recovering quantized data with missing information using bilinear factorization and augmented Lagrangian method","author":"esmaeili","year":"2018","journal-title":"arXiv preprint arXiv 1810 06008"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2016.7869063"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2821648"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2016.7472065"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2549040"},{"key":"ref19","first-page":"1727","article-title":"Probabilistic low-rank matrix completion on finite alphabets","author":"lafond","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref6","article-title":"Transduction with matrix completion using smoothed rank function","author":"esmaeili","year":"2018","journal-title":"arXiv preprint arXiv 1805 07561"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/984622.984630"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iau006"},{"key":"ref7","first-page":"1","article-title":"Probabilistic low-rank matrix completion from quantized measurements","volume":"17","author":"bhaskar","year":"2016","journal-title":"J Mach Learn Res"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref9","first-page":"3619","article-title":"A max-norm constrained minimization approach to 1-bit matrix completion","volume":"14","author":"cai","year":"2013","journal-title":"J Mach Learn Res"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2018.2801836"},{"key":"ref22","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7132.001.0001","author":"blake","year":"1987","journal-title":"Visual Reconstruction"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2295557"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"ref23","article-title":"Quantized matrix completion for personalized learning","author":"lan","year":"0","journal-title":"Proc Int Conf Educ Data Mining"},{"key":"ref26","year":"2003"},{"key":"ref25","article-title":"Movielens100 k website","year":"0"}],"container-title":["IEEE Signal Processing Letters"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/97\/8584151\/8603746-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/97\/8584151\/08603746.pdf?arnumber=8603746","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:07:53Z","timestamp":1657746473000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8603746\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2]]},"references-count":26,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/lsp.2019.2891134","relation":{},"ISSN":["1070-9908","1558-2361"],"issn-type":[{"value":"1070-9908","type":"print"},{"value":"1558-2361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2]]}}}