{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T14:18:53Z","timestamp":1780064333311,"version":"3.54.0"},"reference-count":53,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2017]]},"DOI":"10.1109\/tit.2017.2672725","type":"journal-article","created":{"date-parts":[[2017,2,22]],"date-time":"2017-02-22T19:14:57Z","timestamp":1487790897000},"page":"1-1","source":"Crossref","is-referenced-by-count":35,"title":["Preconditioned Data Sparsification for Big Data with Applications to PCA and K-means"],"prefix":"10.1109","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4078-1676","authenticated-orcid":false,"given":"Farhad","family":"Pourkamali-Anaraki","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephen","family":"Becker","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2375327"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973440.49"},{"key":"ref33","first-page":"1565","article-title":"Near-optimal entrywise sampling for data matrices","author":"achlioptas","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1219092.1219097"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380858"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.53"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020558"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2002.1047453"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0114-2"},{"key":"ref34","author":"bishop","year":"2006","journal-title":"Pattern Recognition and Machine Learning"},{"key":"ref28","first-page":"91","article-title":"A statistical perspective on algorithmic leveraging","author":"ma","year":"2014","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150436"},{"key":"ref29","first-page":"3475","article-title":"Fast approximation of matrix coherence and statistical leverage","volume":"13","author":"drineas","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.1561\/9781933019604","author":"muthukrishnan","year":"2005","journal-title":"Data streams Algorithms and applications"},{"key":"ref1","author":"jolliffe","year":"2002","journal-title":"Principal Component Analysis"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447148"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2012.6467015"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2009.2025089"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2429594"},{"key":"ref23","first-page":"2332","article-title":"Efficient recovery of principal components from compressive measurements with application to Gaussian mixture model estimation","author":"pourkamali-anaraki","year":"2014","journal-title":"Proc IEEE Int Conf Acoust Speech Signal Process (ICASSP)"},{"key":"ref26","article-title":"Extreme compressive sampling for covariance estimation","author":"azizyan","year":"2015"},{"key":"ref25","first-page":"1341","article-title":"Memory and computation efficient PCA via very sparse random projections","author":"pourkamali-anaraki","year":"2014","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2002.1017616"},{"key":"ref51","doi-asserted-by":"crossref","first-page":"301","DOI":"10.7551\/mitpress\/7496.003.0015","article-title":"Training invariant support vector machines using selective sampling","author":"loosli","year":"2007","journal-title":"Large Scale Kernel Machines"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOP892"},{"key":"ref52","author":"massart","year":"2003","journal-title":"Concentration Inequalities and Model Selection"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.914731"},{"key":"ref11","first-page":"2886","article-title":"Memory limited, streaming PCA","author":"mitliagkas","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.103"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1561\/2200000048"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2009.2039178"},{"key":"ref14","article-title":"Sketched SVD: Recovering spectral features from compressive measurements","author":"gilbert","year":"2012"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2302736"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2165821"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2012.6288631"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6638709"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SAMPTA.2015.7148937"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/060673096"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2327238"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00025-4"},{"key":"ref5","doi-asserted-by":"crossref","DOI":"10.1090\/gsm\/132","volume":"132","author":"tao","year":"2012","journal-title":"Topics in Random Matrix Theory"},{"key":"ref8","first-page":"123","article-title":"Randomized algorithms for matrices and data","volume":"3","author":"mahoney","year":"2011","journal-title":"Found Trends Mach Learn"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1137\/12086755X"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10073"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1142\/S1793536911000787"},{"key":"ref45","first-page":"3088","article-title":"Structured transforms for small-footprint deep learning","author":"sindhwani","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref48","first-page":"1027","article-title":"$K$ -means++: The advantages of careful seeding","author":"arthur","year":"2007","journal-title":"Proc SODA"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511840371"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2396477"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746569"},{"key":"ref44","first-page":"244","article-title":"Fastfood&#x2013;approximating kernel expansions in loglinear time","author":"le","year":"2013","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2170977"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/4667673\/07862251.pdf?arnumber=7862251","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T15:50:50Z","timestamp":1750002650000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7862251\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":53,"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2672725","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}