{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T13:58:56Z","timestamp":1770818336857,"version":"3.50.1"},"reference-count":56,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Singapore National Research Foundation Fellowship","award":["A-0005077-01-00"],"award-info":[{"award-number":["A-0005077-01-00"]}]},{"name":"Institute for Information & Communications Technology Planning & Evaluation","award":["2020-0-00626"],"award-info":[{"award-number":["2020-0-00626"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/tsp.2022.3174423","type":"journal-article","created":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T19:57:55Z","timestamp":1652299075000},"page":"2681-2697","source":"Crossref","is-referenced-by-count":3,"title":["Mc2g: An Efficient Algorithm for Matrix Completion With Social and Item Similarity Graphs"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6114-8453","authenticated-orcid":false,"given":"Qiaosheng","family":"Zhang","sequence":"first","affiliation":[{"name":"Shanghai Artificial Intelligence Laboratory, Shanghai, China"}]},{"given":"Geewon","family":"Suh","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering, Korea Advanced Institute of Science and Technology, Daejeon, South Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3101-4291","authenticated-orcid":false,"given":"Changho","family":"Suh","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering, Korea Advanced Institute of Science and Technology, Daejeon, South Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5008-4527","authenticated-orcid":false,"given":"Vincent Y. F.","family":"Tan","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering and Department of Mathematics, National University of Singapore, Singapore"}]}],"member":"263","reference":[{"key":"ref1","first-page":"4272","article-title":"Binary rating estimation with graph side information","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Ahn","year":"2018"},{"key":"ref2","first-page":"5107","article-title":"Discrete-valued latent preference matrix estimation with graph side information","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Jo","year":"2021"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458205"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935877"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.231"},{"key":"ref6","article-title":"Matrix completion on graphs","volume-title":"Proc. Neural Inf. Process. Syst. Workshop Out Box: Robustness High Dimens.","author":"Kalofolias","year":"2014"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.35"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.5555\/2969442.2969475"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/138859.138867"},{"key":"ref10","first-page":"23","article-title":"Bayesian mixed-effects models for recommender systems","author":"Condliff","year":"1999","journal-title":"Proc. ACM SIGIR Workshop Recommender Syst."},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219869"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2021.3052033"},{"key":"ref13","first-page":"35","article-title":"The Netflix prize","volume-title":"Proc. KDD Cup Workshop","volume":"2007","author":"Bennett","year":"2007"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90021-7"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411866"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1134271.1134277"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2212015"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2441042"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2144977"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2301139"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1864708.1864736"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9153"},{"key":"ref26","article-title":"Controversial users demand local trust metrics: An experimental study on epinions.com community","author":"Massa","year":"2005","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2365952.2365969"},{"key":"ref28","first-page":"3700","article-title":"Geometric matrix completion with recurrent multi-graph neural networks","author":"Monti","year":"2017","journal-title":"Proc. Neural Inf. Process. Syst."},{"key":"ref29","first-page":"1","article-title":"Graph convolutional matrix completion","volume-title":"Proc. ACM SIGKDD Int. Conf. Knowl. Discov. Data Min.","author":"Berg","year":"2018"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331267"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636058"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2490670"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-014-0576-6"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.47"},{"key":"ref35","first-page":"6446","article-title":"Community detection and stochastic block models: Recent developments","volume":"18","author":"Abbe","year":"2017","journal-title":"J. Mach. Learn. Res."},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1214\/15-aos1428"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2653804"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2018.2834874"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2018.2889920"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919733"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006796"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.soc.27.1.415"},{"key":"ref43","first-page":"391","article-title":"Stochastic block model and community detection in sparse graphs: A spectral algorithm with optimal rate of recovery","author":"Chin","year":"2015","journal-title":"Proc. Conf. Learn. Theory"},{"issue":"1","key":"ref44","first-page":"1980","article-title":"Achieving optimal misclassification proportion in stochastic block models","volume":"18","author":"Gao","year":"2017","journal-title":"J. Mach. Learn. Res."},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1523097113"},{"key":"ref46","first-page":"1319","article-title":"Density evolution in the degree-correlated stochastic block model","volume-title":"Proc. Conf. Learn. Theory","author":"Mossel","year":"2016"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1312486110"},{"key":"ref48","first-page":"973","article-title":"Optimal cluster recovery in the labeled stochastic block model","author":"Yun","year":"2016","journal-title":"Proc. 30th Int. Conf. Neural Inf. Process. Syst."},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2249572"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"issue":"1","key":"ref52","first-page":"1665","article-title":"Restricted strong convexity and weighted matrix completion: Optimal bounds with noise","volume":"13","author":"Negahban","year":"2012","journal-title":"J. Mach. Learn. Res."},{"key":"ref53","first-page":"1","article-title":"Inductive matrix completion based on graph neural networks","author":"Zhang","year":"2020","journal-title":"Proc. Int. Conf. Learn. Representations"},{"key":"ref54","first-page":"3413","article-title":"A simpler approach to matrix completion","volume":"12","author":"Recht","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2415195"},{"key":"ref56","volume-title":"Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis","author":"Mitzenmacher","year":"2017"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/9675017\/09773065.pdf?arnumber=9773065","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T23:06:49Z","timestamp":1705964809000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9773065\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":56,"URL":"https:\/\/doi.org\/10.1109\/tsp.2022.3174423","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}