{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,25]],"date-time":"2026-10-25T23:04:54Z","timestamp":1792969494967,"version":"4.5.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006974","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T14:54:37Z","timestamp":1504018477000},"page":"2473-2477","source":"Crossref","is-referenced-by-count":3,"title":["Information-theoretic limits of subspace clustering"],"prefix":"10.1109","author":[{"given":"Kwangjun","family":"Ahn","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kangwook","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Changho","family":"Suh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2490670"},{"key":"ref11","author":"mossel","year":"2012","journal-title":"Stochastic Block Models and Reconstruction"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2546280"},{"key":"ref13","article-title":"Community recovery in graphs with locality","author":"chen","year":"2016","journal-title":"International Conference on Machine Learning"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852294"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541628"},{"key":"ref16","author":"ahn","year":"2017","journal-title":"Information-theoretic limits of subspace clustering (full version)"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"ref18","article-title":"Solving random quadratic systems of equations is nearly as easy as solving linear systems","author":"chen","year":"2015","journal-title":"Advances in neural information processing systems"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s004540010019"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-008-0178-9"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2010.939739"},{"key":"ref6","first-page":"2487","article-title":"Greedy feature selection for subspace clustering","volume":"14","author":"dyer","year":"2013","journal-title":"Journal of Machine Learning Research"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.57"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.50"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2472520"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2003.1211332"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-007-0099-z"},{"key":"ref9","article-title":"Uniform hypergraph partitioning: Provable tensor methods and sampling techniques","volume":"abs 1602 6516","author":"ghoshdastidar","year":"2016","journal-title":"CoRR"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","location":"Aachen, Germany","start":{"date-parts":[[2017,6,25]]},"end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08006974.pdf?arnumber=8006974","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,30]],"date-time":"2017-08-30T00:25:09Z","timestamp":1504052709000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006974\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006974","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}