{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T03:56:34Z","timestamp":1752983794376,"version":"3.37.3"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CAREER IIS-1252412"],"award-info":[{"award-number":["CAREER IIS-1252412"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["YIP FA9550-14-1-0285"],"award-info":[{"award-number":["YIP FA9550-14-1-0285"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["BCS-0941518"],"award-info":[{"award-number":["BCS-0941518"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1109\/tit.2018.2879912","type":"journal-article","created":{"date-parts":[[2018,11,6]],"date-time":"2018-11-06T19:47:30Z","timestamp":1541533650000},"page":"685-706","source":"Crossref","is-referenced-by-count":10,"title":["A Theoretical Analysis of Noisy Sparse Subspace Clustering on Dimensionality-Reduced Data"],"prefix":"10.1109","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9410-0392","authenticated-orcid":false,"given":"Yining","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6403-212X","authenticated-orcid":false,"given":"Yu-Xiang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aarti","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"1000","article-title":"Differentially private subspace clustering","author":"wang","year":"2015","journal-title":"Proc NIPS"},{"key":"ref38","first-page":"64","article-title":"Provable subspace clustering: When LRR meets SSC","author":"wang","year":"2013","journal-title":"Proc NIPS"},{"key":"ref33","first-page":"3413","article-title":"A simpler approach to matrix completion","volume":"12","author":"recht","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref32","first-page":"712","article-title":"Dimensionality reduction with subspace structure preservation","author":"arpit","year":"2014","journal-title":"Proc NIPS"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iaw021"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875384"},{"journal-title":"Solving the Low-Rank Representation (LRR) Problems","year":"2013","author":"liu","key":"ref37"},{"journal-title":"Constrained Optimization and Lagrange Multiplier Methods","year":"2014","author":"bertsekas","key":"ref36"},{"journal-title":"?On the Power of Adaptivity in Matrix Completion and Approximation ?","year":"2014","author":"krishnamurthy","key":"ref35"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513344"},{"key":"ref28","first-page":"538","article-title":"Graph connectivity in noisy sparse subspace clustering","author":"wang","year":"2016","journal-title":"Proc AISTATS"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"ref29","first-page":"1422","article-title":"A deterministic analysis of noisy sparse subspace clustering for dimensionality-reduced data","author":"wang","year":"2015","journal-title":"Proc ICML"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1177153"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008000628999"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488620"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.29012\/jpc.v5i1.625"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2009605"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2472520"},{"key":"ref23","first-page":"2258","article-title":"Subspace embeddings for the polynomial kernel","author":"avron","year":"2014","journal-title":"Proc NIPS"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.103"},{"key":"ref25","first-page":"2753","article-title":"Greedy subspace clustering","author":"park","year":"2014","journal-title":"Proc NIPS"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/S1874-5849(01)80010-3"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1085"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.88"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-013-0317-y"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.57"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1214\/12-AOS1034"},{"key":"ref14","first-page":"1","article-title":"Noisy sparse subspace clustering","volume":"17","author":"wang","year":"2016","journal-title":"J Mach Learn Res"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOS1199"},{"key":"ref16","first-page":"849","article-title":"On spectral clustering: Analysis and an algorithm","author":"ng","year":"2002","journal-title":"Proc NIPS"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2010.939739"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/060673096"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00400-6"},{"key":"ref4","first-page":"944","article-title":"Guess who rated this movie: Identifying users through subspace clustering","author":"zhang","year":"2012","journal-title":"Proc UAI"},{"key":"ref3","first-page":"373","article-title":"High-rank matrix completion","author":"eriksson","year":"2012","journal-title":"Proc AISTATS"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008324625522"},{"key":"ref5","first-page":"2213","article-title":"Clustering partially observed graphs via convex optimization","author":"jalali","year":"2011","journal-title":"Proc ICML"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.244"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1023\/A:1004678431677"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-011-9099-z"},{"key":"ref9","first-page":"94","article-title":"A general framework for motion segmentation: Independent, articulated, rigid, non-rigid, degenerate and non-degenerate","author":"yan","year":"2006","journal-title":"Proc ECCV"},{"key":"ref46","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1561\/0400000042","article-title":"The algorithmic foundations of differential privacy","volume":"9","author":"dwork","year":"2014","journal-title":"Found Trends Theor Comput Sci"},{"key":"ref45","first-page":"1","article-title":"Differential privacy","author":"dwork","year":"2006","journal-title":"Automata Languages and Programming"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.105.150401"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1015957395"},{"key":"ref42","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4028-0","author":"willenborg","year":"1996","journal-title":"Statistical Disclosure Control in Practice"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1177011681"},{"key":"ref44","first-page":"265","article-title":"Calibrating noise to sensitivity in private data analysis","author":"dwork","year":"2006","journal-title":"Theory of Cryptography"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1002\/9781118348239"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/18\/8620171\/8525277-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8620171\/08525277.pdf?arnumber=8525277","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:43:10Z","timestamp":1657744990000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8525277\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2]]},"references-count":50,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2018.2879912","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2019,2]]}}}