{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T23:01:49Z","timestamp":1776812509262,"version":"3.51.2"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T00:00:00Z","timestamp":1412121600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["EECS-1056028"],"award-info":[{"award-number":["EECS-1056028"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000774","name":"Defense Threat Reduction Agency","doi-asserted-by":"crossref","award":["HDTRA 1-08-0029"],"award-info":[{"award-number":["HDTRA 1-08-0029"]}],"id":[{"id":"10.13039\/100000774","id-type":"DOI","asserted-by":"crossref"}]},{"name":"DTRA Young Investigator Award"},{"name":"NSF","award":["1302435"],"award-info":[{"award-number":["1302435"]}]},{"name":"NSF","award":["1017525"],"award-info":[{"award-number":["1017525"]}]},{"name":"NSF","award":["0954059"],"award-info":[{"award-number":["0954059"]}]},{"name":"Ministry of Education of Singapore through Academic Research Fund Tier 2","award":["R-265-000-443-112"],"award-info":[{"award-number":["R-265-000-443-112"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1109\/tit.2014.2346205","type":"journal-article","created":{"date-parts":[[2014,8,7]],"date-time":"2014-08-07T14:41:15Z","timestamp":1407422475000},"page":"6440-6455","source":"Crossref","is-referenced-by-count":47,"title":["Improved Graph Clustering"],"prefix":"10.1109","volume":"60","author":[{"given":"Yudong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Sujay","family":"Sanghavi","sequence":"additional","affiliation":[]},{"given":"Huan","family":"Xu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008374125234"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/090766991"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref32","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":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-012-9176-9"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2249572"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20089"},{"key":"ref36","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<5::AID-RSA2>3.0.CO;2-Z"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.58"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794270248"},{"key":"ref40","first-page":"661","article-title":"Spectral clustering on a budget","author":"shamir","year":"2011","journal-title":"Proc 14th Int Conf Artif Intell Statist"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548304006303"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1773"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972962.4"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.22"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)00133-9"},{"key":"ref16","first-page":"903","article-title":"Hill-climbing finds random planted bisections","author":"carson","year":"2001","journal-title":"Proc 12th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/11537311_38"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20181"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548309990514"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/090761793"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27836-8_34"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.108.188701"},{"key":"ref3","article-title":"Spectral clustering of graphs with general degrees in the extended planted partition model","author":"chaudhuri","year":"2012","journal-title":"Proc of the Annual Conf on Learning Theory (COLT)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90021-7"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/1098-2418(200103)18:2<116::AID-RSA1001>3.0.CO;2-2"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<457::AID-RSA14>3.0.CO;2-W"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0733-1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367591"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959929"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"ref46","first-page":"404","article-title":"Online robust PCA via stochastic optimization","author":"feng","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1214\/11-AOS887"},{"key":"ref45","author":"bhatia","year":"1987","journal-title":"Perturbation Bounds for Matrix Eigenvalues"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0729-x"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/1219092.1219097"},{"key":"ref21","article-title":"Finding dense clusters via &#x2018;low rank + sparse&#x2019; decomposition","author":"oymak","year":"0"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/16.1.30"},{"key":"ref24","first-page":"2239","article-title":"A tensor approach to learning mixed membership community models","volume":"15","author":"anandkumar","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref41","article-title":"The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices","author":"lin","year":"2009"},{"key":"ref23","first-page":"2204","article-title":"Clustering sparse graphs","author":"chen","year":"2012","journal-title":"Advances in Neural Information Processing Systems 25"},{"key":"ref44","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.84.066106"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"ref25","first-page":"995","article-title":"Breaking the small cluster barrier of graph clustering","author":"ailon","year":"2013","journal-title":"Proc 30th Int Conf Mach Learn"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6895347\/06873307.pdf?arnumber=6873307","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:51:19Z","timestamp":1641988279000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6873307\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10]]},"references-count":47,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2346205","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10]]}}}