{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T06:47:56Z","timestamp":1759042076840,"version":"3.37.3"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2018,5,1]],"date-time":"2018-05-01T00:00:00Z","timestamp":1525132800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Signal Process. Lett."],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1109\/lsp.2018.2823268","type":"journal-article","created":{"date-parts":[[2018,4,4]],"date-time":"2018-04-04T18:05:27Z","timestamp":1522865127000},"page":"720-724","source":"Crossref","is-referenced-by-count":6,"title":["Learning Discrete Matrix Factorization Models"],"prefix":"10.1109","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0367-564X","authenticated-orcid":false,"given":"Duc Minh","family":"Nguyen","sequence":"first","affiliation":[]},{"given":"Evaggelia","family":"Tsiligianni","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9300-5860","authenticated-orcid":false,"given":"Nikos","family":"Deligiannis","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060754"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"ref33","first-page":"1","article-title":"Categorical\n reparameterization with gumbel-softmax","author":"jang","year":"0","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref32","first-page":"2131","article-title":"Probabilistic low-rank matrix completion from quantized\n measurements","volume":"17","author":"bhaskar","year":"2016","journal-title":"J Mach Learn Res"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2014.6854548"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-011-9264-x"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.598"},{"key":"ref36","volume":"13","author":"allgower","year":"2012","journal-title":"Numerical Continuation Methods An Introduction"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/18.720541"},{"key":"ref34","article-title":"The\n concrete distribution: A continuous relaxation of discrete random variables","author":"maddison","year":"0","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref10","first-page":"655","article-title":"Low-rank matrix recovery via\n efficient schatten p-norm minimization","author":"nie","year":"0","journal-title":"Proc Conf Artif Intell"},{"key":"ref40","article-title":"A gradient descent algorithm on the grassman manifold for matrix completion","author":"keshavan","year":"2009","journal-title":"arXiv 0910 5260"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0713-z"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/356"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"939","DOI":"10.1109\/TSMCB.2012.2185490","article-title":"Robust alternative minimization for matrix completion","volume":"42","author":"lu","year":"2012","journal-title":"IEEE Trans Syst Man Cybernet Part B Cybernet"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.309"},{"key":"ref16","first-page":"1257","article-title":"Probabilistic matrix factorization","author":"salakhutdinov","year":"0","journal-title":"Proc Int Conf Neural Inform Process Syst"},{"key":"ref17","first-page":"358","article-title":"A unified view of matrix factorization models","author":"singh","year":"0","journal-title":"Proc Eur Conf Mach Learn Knowl Discovery Databases"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/LSP.2009.2027163","article-title":"Semisupervised nonnegative\n matrix factorization","volume":"17","author":"lee","year":"2010","journal-title":"IEEE Signal Process Lett"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052569"},{"key":"ref28","first-page":"1687","article-title":"Optimal discrete matrix\n completion","author":"huo","year":"0","journal-title":"Proc Conf Artif Intell"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref27","first-page":"183","article-title":"Preference preserving hashing for efficient\n recommendation","author":"zhiwei","year":"0","journal-title":"Proc Int Conf Res Dev Inform Retrieval"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2327238"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2015.2421309"},{"key":"ref29","first-page":"424","article-title":"Robust\n discrete matrix completion","author":"huang","year":"0","journal-title":"Proc Conf Artif Intell"},{"article-title":"Neural network matrix factorization","year":"2015","author":"dziugaite","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2601434"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.123"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/110848074"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref1","first-page":"37","article-title":"Effective exemplar-based image inpainting using low-rank matrix completion","author":"lin","year":"0","journal-title":"Proc IEEE Int Conf Awareness Sci Technol"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/447"},{"key":"ref22","first-page":"843","article-title":"Unsupervised learning of video representations using LSTMs","author":"mansimov","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref21","first-page":"1","article-title":"Extendable neural matrix completion","author":"nguyen","year":"0","journal-title":"Proc IEEE Int Conf Acoust Speech Signal Process"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447163"},{"key":"ref41","first-page":"2647","article-title":"Social trust prediction using rank-k matrix recovery","author":"huang","year":"0","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339611"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2017.8309136"}],"container-title":["IEEE Signal Processing Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/97\/8328943\/08331131.pdf?arnumber=8331131","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T07:01:04Z","timestamp":1643180464000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8331131\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5]]},"references-count":41,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/lsp.2018.2823268","relation":{},"ISSN":["1070-9908","1558-2361"],"issn-type":[{"type":"print","value":"1070-9908"},{"type":"electronic","value":"1558-2361"}],"subject":[],"published":{"date-parts":[[2018,5]]}}}