{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T08:05:18Z","timestamp":1729670718927,"version":"3.28.0"},"reference-count":31,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1109\/ciss.2014.6814140","type":"proceedings-article","created":{"date-parts":[[2014,5,16]],"date-time":"2014-05-16T18:41:30Z","timestamp":1400265690000},"page":"1-3","source":"Crossref","is-referenced-by-count":0,"title":["Combinatorial QPs via a low-dimensional subspace sampling"],"prefix":"10.1109","author":[{"given":"Dimitris S.","family":"Papailiopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Megasthenis","family":"Asteris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandros G.","family":"Dimakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390277"},{"key":"17","first-page":"1561","article-title":"Nonnegative sparse pca","author":"zass","year":"2007","journal-title":"Advances in Neural Information Processing Systems 19"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btr522"},{"key":"15","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","article-title":"Learning the parts of objects by nonnegative matrix factorization","volume":"401","author":"lee","year":"1999","journal-title":"Nature"},{"key":"16","first-page":"1457","article-title":"Non-negative matrix factorization with sparseness constraints","volume":"5","author":"hoyer","year":"2004","journal-title":"Journal of Machine Learning Research"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btm134"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1142\/9789812702456_0043"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOS1097"},{"journal-title":"Sparse Pca Via Covariance Thresholding","year":"2013","author":"deshpande","key":"12"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010050"},{"key":"20","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1007\/978-3-642-12683-3_30","article-title":"Dense subgraphs with restrictions and applications to gene annotation graphs","author":"saha","year":"2010","journal-title":"Research in Computational Molecular Biology"},{"key":"22","first-page":"201","article-title":"Detecting high log-densities: An o (n 1\/4) approximation for densest k-subgraph","author":"bhaskara","year":"2010","journal-title":"Proceedings of the 42nd ACM Symposium on Theory of Computing"},{"journal-title":"Convex Relaxation for the Planted Clique Biclique and Clustering Problems","year":"2011","author":"ames","key":"23"},{"journal-title":"Weak Recovery Conditions Using Graph Partitioning Bounds","year":"2010","author":"daspremont et al","key":"24"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488694"},{"journal-title":"Sparse Pca Approximations in Nearly-linear Time","year":"2014","author":"papailiopoulos","key":"26"},{"journal-title":"Nonnegative Sparse Pca with Provable Guarantees","year":"2014","author":"asteris","key":"27"},{"journal-title":"Finding Dense Subgraphs Via Low-rank Bilinear Optimization","year":"2014","author":"papailiopoulos","key":"28"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048450"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1137\/050645506"},{"key":"2","first-page":"1269","article-title":"Optimal solutions for sparse principal component analysis","volume":"9","author":"d'aspremont","year":"2008","journal-title":"The Journal of Machine Learning Research"},{"key":"10","doi-asserted-by":"crossref","first-page":"2454","DOI":"10.1109\/ISIT.2008.4595432","article-title":"High-dimensional analysis of semidefinite relaxations for sparse principal components","author":"amini","year":"2008","journal-title":"Information Theory 2008 ISIT 2008 IEEE International Symposium on"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1198\/106186006X113430"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034216"},{"key":"7","first-page":"517","article-title":"Generalized power method for sparse principal component analysis","volume":"11","author":"journe?e","year":"2010","journal-title":"The Journal of Machine Learning Research"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmva.2007.06.007"},{"key":"5","first-page":"915","article-title":"Spectral bounds for sparse pca: Exact and greedy algorithms","volume":"18","author":"moghaddam","year":"2006","journal-title":"NIPS"},{"key":"31","first-page":"747","article-title":"Sparse pca through low-rank approximations","author":"papailiopoulos","year":"2013","journal-title":"Proceedings of the 28th International Conference on Machine Learning"},{"key":"4","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/1273496.1273601","article-title":"Sparse eigen methods by dc programming","author":"sriperumbudur","year":"2007","journal-title":"Proceedings of the 24th International Conference on Machine Learning"},{"key":"9","first-page":"2670","article-title":"Fantope projection and selection: A near-optimal convex relaxation of sparse pca","author":"vu","year":"2013","journal-title":"NIPS"},{"journal-title":"Truncated Power Method for Sparse Eigenvalue Problems","year":"2011","author":"yuan","key":"8"}],"event":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","start":{"date-parts":[[2014,3,19]]},"location":"Princeton, NJ, USA","end":{"date-parts":[[2014,3,21]]}},"container-title":["2014 48th Annual Conference on Information Sciences and Systems (CISS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6809375\/6814063\/06814140.pdf?arnumber=6814140","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T14:49:07Z","timestamp":1648997347000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6814140\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/ciss.2014.6814140","relation":{},"subject":[],"published":{"date-parts":[[2014,3]]}}}