{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T07:56:17Z","timestamp":1764402977526,"version":"3.37.3"},"reference-count":65,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61771356"],"award-info":[{"award-number":["61771356"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"CSC's scholarship"},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2019-06271","RGPAS-2019-00110"],"award-info":[{"award-number":["RGPIN-2019-06271","RGPAS-2019-00110"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/tsp.2020.2988784","type":"journal-article","created":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T19:39:02Z","timestamp":1587411542000},"page":"2814-2829","source":"Crossref","is-referenced-by-count":14,"title":["Graph Sampling for Matrix Completion Using Recurrent Gershgorin Disc Shift"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9109-4086","authenticated-orcid":false,"given":"Fen","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0640-4140","authenticated-orcid":false,"given":"Yongchao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5571-4137","authenticated-orcid":false,"given":"Gene","family":"Cheung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3540-1598","authenticated-orcid":false,"given":"Cheng","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"15","article-title":"Matrix completion via graph signal processing","author":"huang","year":"0","journal-title":"Proc 43rd IEEE Int Conf Acoust Speech Signal Process Calgary AB"},{"key":"ref38","article-title":"Active matrix completion with uncertainty quantification","author":"mak","year":"2017","journal-title":"arXiv 1706 08037"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2981202"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8682200"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2940129"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2573748"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783259"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-7637-6_24"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2016.2614903"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2573767"},{"year":"2019","key":"ref60","article-title":"Filmtrust dataset"},{"year":"2019","key":"ref62","article-title":"IMC code"},{"key":"ref61","article-title":"GSPBOX: A toolbox for signal processing on graphs","author":"perraudin","year":"2014","journal-title":"arXiv 1408 5781"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2755586"},{"key":"ref64","first-page":"2301","article-title":"Speedup matrix completion with side information: Application to multi-label learning","author":"xu","year":"0","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2018.2818062"},{"article-title":"On the kronecker product","year":"2004","author":"schacke","key":"ref65"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2014.7032257"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref1","first-page":"785","article-title":"A new theory for matrix completion","author":"liu","year":"0","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2016.05.005"},{"key":"ref22","article-title":"Graph convolutional matrix completion","author":"berg","year":"2017","journal-title":"KDD'18 Deep Learning Day"},{"key":"ref21","first-page":"2107","article-title":"Collaborative filtering with graph information: Consistency and scalable methods","author":"rao","year":"0","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"5603","DOI":"10.1090\/S0002-9947-08-04511-X","article-title":"Sampling in Paley-Wiener spaces on combinatorial graphs","volume":"360","author":"pesenson","year":"0","journal-title":"Trans Amer Math Soc"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2018.8462164"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2469645"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2014.6854325"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176349033"},{"key":"ref51","first-page":"5403","article-title":"Approximate supermodularity bounds for experimental design","author":"chamon","year":"0","journal-title":"Proc Advances Neural Inf Process Syst"},{"year":"2019","key":"ref59","article-title":"Jester dataset"},{"year":"2019","key":"ref58","article-title":"Book-crossing dataset"},{"year":"2019","key":"ref57","article-title":"Movielens"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1080\/03081088108817379"},{"journal-title":"Matrix Analysis","year":"1990","author":"horn","key":"ref55"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-007-9096-y"},{"key":"ref53","volume":"3","author":"golub","year":"2012","journal-title":"Matrix Computations"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17798-9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2820126"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2864654"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2978617"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2018.8646609"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2914879"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2546233"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1995.7.1.108"},{"key":"ref16","first-page":"3697","article-title":"Geometric matrix completion with recurrent multi-graph neural networks","author":"monti","year":"0","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2012.12.012"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827500366124"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2908129"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref3","article-title":"Matrix completion on graphs","author":"kalofolias","year":"2014","journal-title":"Neural Information Processing 2014"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-7637-6_24"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.69"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220084"},{"key":"ref7","first-page":"836","article-title":"Low-rank matrix and tensor completion via adaptive sampling","author":"krishnamurthy","year":"0","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143980"},{"key":"ref9","first-page":"2999","article-title":"Completing any low-rank matrix, provably","volume":"16","author":"chen","year":"2015","journal-title":"J Mach Learn Res"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2018.2854627"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2020.2969052"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref47","volume":"50","author":"pukelsheim","year":"1993","journal-title":"Optimal Design of Experiments"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2018.2874290"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2799702"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2019.2961429"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2651400"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/8933520\/09072623.pdf?arnumber=9072623","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T14:41:21Z","timestamp":1651070481000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9072623\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":65,"URL":"https:\/\/doi.org\/10.1109\/tsp.2020.2988784","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"type":"print","value":"1053-587X"},{"type":"electronic","value":"1941-0476"}],"subject":[],"published":{"date-parts":[[2020]]}}}