{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T09:26:33Z","timestamp":1730193993150,"version":"3.28.0"},"reference-count":39,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1109\/acssc.2018.8645348","type":"proceedings-article","created":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T16:31:40Z","timestamp":1552926700000},"page":"2099-2103","source":"Crossref","is-referenced-by-count":0,"title":["Randomized Robust matrix Completion for the Community Detection Problem"],"prefix":"10.1109","author":[{"given":"Adel","family":"Karimian","sequence":"first","affiliation":[]},{"given":"Mostafa","family":"Rahmani","sequence":"additional","affiliation":[]},{"given":"Andre","family":"Beckus","sequence":"additional","affiliation":[]},{"given":"George K.","family":"Atia","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Elements of Information Theory","year":"2006","author":"cover","key":"ref39"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.57"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-0587-3"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132597"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2017.2723472"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536446"},{"key":"ref37","article-title":"Efficient clustering with limited distance information","author":"voevodski","year":"2010","journal-title":"arXiv preprint arXiv 1009 5168"},{"key":"ref36","first-page":"31","article-title":"A new randomized algorithm for community detection in large networks","volume":"49","author":"kirianovskii","year":"2016","journal-title":"IFACPapersOnLine"},{"key":"ref35","first-page":"138","article-title":"Community detection via random and adaptive sampling","author":"yun","year":"2014","journal-title":"Proc Conf Learn Theory"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27836-8_35"},{"key":"ref10","first-page":"1051","article-title":"Semidefinite programs for exact recovery of a hidden community","volume":"49","author":"hajek","year":"2016","journal-title":"J Mach Learn Res"},{"key":"ref11","article-title":"Finding dense clusters via &#x201C;low rank + sparse&#x201D; decomposition","author":"oymak","year":"2011","journal-title":"ArXiv e-prints"},{"key":"ref12","first-page":"2213","article-title":"Clustering partially observed graphs via convex optimization","volume":"15","author":"chen","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref13","first-page":"2996","article-title":"Graph clustering with missing data: Convex algorithms and analysis","author":"korlakai","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref14","article-title":"From node embedding to community embedding","author":"zheng","year":"2016","journal-title":"ArXiv e-prints"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2017.2731163"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90021-7"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1002\/1098-2418(200103)18:2<116::AID-RSA1001>3.0.CO;2-2"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1023\/B:MACH.0000033116.57574.95"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/090761793"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1178"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2401536"},{"key":"ref3","article-title":"Communities in networks","volume":"56","author":"porter","year":"2009","journal-title":"Not AMS"},{"key":"ref6","article-title":"Community detection in weighted brain connectivity networks beyond the resolution limit","author":"nicolini","year":"2016","journal-title":"ArXiv e-prints"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/0917055"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77004-6_5"},{"key":"ref8","first-page":"284","article-title":"Computing communities in large networks using random walks","author":"pons","year":"2005","journal-title":"Proc 20th Int Symp Comput Inform Sci"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6170-8_35"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/331499.331504"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2016.09.002"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2249572"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2158250"},{"key":"ref24","first-page":"1206","article-title":"A subspace learning approach for high dimensional matrix decomposition with efficient column\/row sampling","author":"rahmani","year":"2016","journal-title":"Proc 33rd Int Conf Mach Learn"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2649482"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2645515"},{"key":"ref25","first-page":"1134","article-title":"Divide-and-conquer matrix factorization","author":"mackey","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst"}],"event":{"name":"2018 52nd Asilomar Conference on Signals, Systems, and Computers","start":{"date-parts":[[2018,10,28]]},"location":"Pacific Grove, CA, USA","end":{"date-parts":[[2018,10,31]]}},"container-title":["2018 52nd Asilomar Conference on Signals, Systems, and Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8638648\/8645065\/08645348.pdf?arnumber=8645348","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T18:57:49Z","timestamp":1598209069000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8645348\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/acssc.2018.8645348","relation":{},"subject":[],"published":{"date-parts":[[2018,10]]}}}