{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T10:05:19Z","timestamp":1729677919254,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6034216","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T17:24:20Z","timestamp":1317921860000},"page":"673-677","source":"Crossref","is-referenced-by-count":10,"title":["Sparse principal component of a rank-deficient matrix"],"prefix":"10.1109","author":[{"given":"Megasthenis","family":"Asteris","sequence":"first","affiliation":[]},{"given":"Dimitris S.","family":"Papailiopoulos","sequence":"additional","affiliation":[]},{"given":"George N.","family":"Karystinos","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"Spectral bounds for sparse PCA: exact and greedy algorithms","author":"moghaddam","year":"2006","journal-title":"Advances in neural information processing systems"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2007.4409093"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273601"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1198\/106186006X113430"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0769-0_31"},{"key":"ref15","first-page":"1269","article-title":"Optimal solutions for sparse principal component analysis","volume":"9","author":"d\u2019aspremont","year":"2008","journal-title":"Journal of Machine Learning Research"},{"journal-title":"Introduction to Algorithms","year":"2001","author":"cormen","key":"ref16"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1080\/757584395"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1080\/757584614"},{"key":"ref6","article-title":"Generalized power method for sparse principal component analysis","author":"journee","year":"2008","journal-title":"arXiv 0811 4724"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1198\/1061860032148"},{"key":"ref8","first-page":"1017","article-title":"Deflation methods for sparse pea","volume":"21","author":"mackey","year":"2009","journal-title":"Advances in neural information processing systems"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289233"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1214\/08-AOS664"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1137\/050645506","article-title":"A direct formulation for sparse PCA using semidefinite programming","volume":"49","author":"d\u2019aspremont","year":"2007","journal-title":"SIAM Review"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143925"}],"event":{"name":"2011 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2011,7,31]]},"location":"St. Petersburg, Russia","end":{"date-parts":[[2011,8,5]]}},"container-title":["2011 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6026198\/6033677\/06034216.pdf?arnumber=6034216","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T07:35:46Z","timestamp":1497944146000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6034216\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6034216","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}