{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T13:23:26Z","timestamp":1779888206760,"version":"3.53.1"},"reference-count":45,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518134","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"2113-2118","source":"Crossref","is-referenced-by-count":2,"title":["When to Use Graph Side Information in Matrix Completion"],"prefix":"10.1109","author":[{"given":"Geewon","family":"Suh","sequence":"first","affiliation":[{"name":"EE, KAIST"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sangwoo","family":"Jeon","sequence":"additional","affiliation":[{"name":"EE, KAIST"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Changho","family":"Suh","sequence":"additional","affiliation":[{"name":"EE, KAIST"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","first-page":"2139","article-title":"Minimax theory for high-dimensional gaussian mixtures with sparse mean separation","volume":"26","author":"azizyan","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"ref38","first-page":"4682","article-title":"Query complexity of clustering with side information","author":"mazumdar","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref33","article-title":"Trustsvd: Collaborative filtering with both the explicit and implicit influence of user trust and of item ratings","volume":"29","author":"guo","year":"0","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401944"},{"key":"ref31","first-page":"115","article-title":"Knn-based clustering for improving social recommender systems","author":"pan","year":"2012","journal-title":"6th Int Workshop on Agents and Data Mining Interaction"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1214\/17-AOS1541"},{"key":"ref37","first-page":"3224","article-title":"Clustering with same-cluster queries","author":"ashtiani","year":"0","journal-title":"Proceedings of the 30th International Conference on Neural Information Processing Systems"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/18M1209854"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2375327"},{"key":"ref34","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":"0","journal-title":"Conference on Learning Theory"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312230"},{"key":"ref40","first-page":"2323","article-title":"Influential features pca for high dimensional clustering","author":"jin","year":"2016","journal-title":"The Annals of Statistics"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30468-5_31"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CCNC.2006.1593032"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557067"},{"key":"ref14","first-page":"1548","article-title":"Graph regularized nonnegative matrix factorization for data representation","volume":"33","author":"cai","year":"2010","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935877"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.192"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-013-0141-9"},{"key":"ref18","first-page":"3697","article-title":"Geometric matrix completion with recurrent multi-graph neural networks","author":"monti","year":"0","journal-title":"Advances in neural information processing systems"},{"key":"ref19","first-page":"4272","article-title":"Binary rating estimation with graph side information","volume":"31","author":"ahn","year":"0","journal-title":"Advances in neural information processing systems"},{"key":"ref28","first-page":"689","article-title":"Community recovery in graphs with locality","author":"chen","year":"2016","journal-title":"International Conference on Machine Learning"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref27","first-page":"371","article-title":"Spectral mle: Top-k rank aggregation from pairwise comparisons","author":"chen","year":"2015","journal-title":"International Conference on Machine Learning"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1214\/14-AOS1274","article-title":"Consistency of spectral clustering in stochastic block models","volume":"43","author":"lei","year":"2015","journal-title":"The Annals of Statistics"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2928130"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054251"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2011.12.021"},{"key":"ref1","author":"fazel","year":"2002","journal-title":"Matrix Rank Minimization With Applications"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636058"},{"key":"ref45","first-page":"36","article-title":"The political blogosphere and the 2004 us election: divided they blog","author":"adamic","year":"0","journal-title":"Proceedings of the 3rd international workshop on Link discovery"},{"key":"ref22","article-title":"Discrete-valued preference estimation with graph side information","author":"jo","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref21","article-title":"Matrix completion with hierarchical graph side information","author":"elmahdy","year":"0","journal-title":"34th Conference on Neural Information Processing Systems NeurIPS 2020"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548317000463"},{"key":"ref24","article-title":"Mc2g: An efficient algorithm for matrix completion with social and item similarity graphs","author":"zhang","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1214\/16-AOS1522"},{"key":"ref23","article-title":"Community detection and matrix completion with social and item similarity graphs","author":"zhang","year":"2021","journal-title":"IEEE Transactions on Signal Processing"},{"key":"ref44","first-page":"281","article-title":"Some methods for classification and analysis of multivariate observations","volume":"1","author":"macqueen","year":"1967","journal-title":"Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.47"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-014-0576-6"},{"key":"ref25","first-page":"1980","article-title":"Achieving optimal misclassification proportion in stochastic block models","volume":"18","author":"gao","year":"2017","journal-title":"The Journal of Machine Learning Research"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09518134.pdf?arnumber=9518134","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:36Z","timestamp":1773347736000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518134\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":45,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518134","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}