Sparse PCA through low-rank approximations

30th International Conference on Machine Learning, ICML 2013

Volumn , Issue PART 3, 2013, Pages 1784-1792

  Papailiopoulos, Dimitris S ^a   Dimakis, Alexandros G ^a   Korokythakis, Stavros ^b  

^a The University of Texas at Austin   (United States)

^b Stochastic Technologies   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; LEARNING SYSTEMS; PRINCIPAL COMPONENT ANALYSIS;

EXPERIMENTAL EVALUATION; LOW RANK APPROXIMATIONS; NOVEL ALGORITHM; POLYNOMIAL-TIME APPROXIMATION ALGORITHMS; POSITIVE SEMIDEFINITE MATRICES; PRINCIPAL COMPONENTS; SPECTRAL PROFILE; STATE OF THE ART;

APPROXIMATION ALGORITHMS;

EID: 84897564953     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. Amini, A.A. and Wainwright, M.J. High-dimensional analysis of semidefinite relaxations for sparse principal components. In Information Theory, 2008. ISIT 2008. IEEE International Symposium on, pp. 2454-2458. IEEE, 2008.
2. Asteris, M., Papailiopoulos, D.S., and Karystinos, G.N. Sparse principal component of a rank-deficient matrix. In Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on, pp. 673-677. IEEE, 2011.
3. Cadima, J. and Jolliffe, I.T. Loading and correlations in the interpretation of principle compenents. Journal of Applied Statistics, 22(2):203-214, 1995.
4. d'Aspremont, A., El Ghaoui, L., Jordan, M.I., and Lanckriet, G.R.G. A direct formulation for sparse pca using semidefinite programming. SIAM review, 49(3):434-448, 2007a. (Pubitemid 47377693)
5. d'Aspremont, A., Bach, F., and Ghaoui, L.E. Optimal solutions for sparse principal component analysis. The Journal of Machine Learning Research, 9:1269-1294, 2008.
6. d'Aspremont, A., Bach, F., and Ghaoui, L.E. Approximation bounds for sparse principal component analysis. arXiv preprint arXiv:1205.0121, 2012.
7. d'Aspremont, Alexandre, Bach, Francis R., and Ghaoui, Laurent El. Full regularization path for sparse principal component analysis. In Proceedings of the 24th international conference on Machine learning, ICML '07, pp. 177-184, 2007b.
8. Gawalt, B., Zhang, Y., and El Ghaoui, L. Sparse pca for text corpus summarization and exploration. NIPS 2010 Workshop on Low-Rank Matrix Approximation, 2010.
9. Jolliffe, I.T. Rotation of principal components: choice of normalization constraints. Journal of Applied Statistics, 22(1):29-35, 1995.
10. Jolliffe, I.T., Trendafilov, N.T., and Uddin, M. A modified principal component technique based on the lasso. Journal of Computational and Graphical Statistics, 12(3):531-547, 2003. (Pubitemid 37239916)
11. Journée, M., Nesterov, Y., Richtárik, P., and Sepulchre, R. Generalized power method for sparse principal component analysis. The Journal of Machine Learning Research, 11:517-553, 2010.
12. Kaiser, H.F. The varimax criterion for analytic rotation in factor analysis. Psychometrika, 23(3):187-200, 1958.
13. Ma, Zongming. Sparse principal component analysis and iterative thresholding. arXiv preprint arXiv:1112.2432, 2011.
14. Mackey, L. Deflation methods for sparse pca. Advances in neural information processing systems, 21:1017-1024, 2009.
15. Moghaddam, B., Weiss, Y., and Avidan, S. Generalized spectral bounds for sparse lda. In Proceedings of the 23rd international conference on Machine learning, pp. 641-648. ACM, 2006a.
16. Moghaddam, B., Weiss, Y., and Avidan, S. Spectral bounds for sparse pca: Exact and greedy algorithms. Advances in neural information processing systems, 18:915, 2006b.
17. Moghaddam, B., Weiss, Y., and Avidan, S. Fast pixel/part selection with sparse eigenvectors. In Computer Vision, 2007. ICCV 2007. IEEE 11th International Conference on, pp. 1-8. IEEE, 2007.
18. Papailiopoulos, D. S., Dimakis, A. G., and Korokythakis, S. Sparse pca through low-rank approximations. arXiv preprint arXiv:1303.0551, 2013.
19. Shen, H. and Huang, J.Z. Sparse principal component analysis via regularized low rank matrix approximation. Journal of multivariate analysis, 99(6):1015-1034, 2008.
20. Sriperumbudur, B.K., Torres, D.A., and Lanckriet, G.R.G. Sparse eigen methods by dc programming. In Proceedings of the 24th international conference on Machine learning, pp. 831-838. ACM, 2007.
21. Yuan, X.T. and Zhang, T. Truncated power method for sparse eigenvalue problems. arXiv preprint arXiv:1112.2679, 2011.
22. Zhang, Y. and El Ghaoui, L. Large-scale sparse principal component analysis with application to text data. Advances in Neural Information Processing Systems, 2011.
23. Zhang, Y., d'Aspremont, A., and Ghaoui, L.E. Sparse pca: Convex relaxations, algorithms and applications. Handbook on Semidefinite, Conic and Polynomial Optimization, pp. 915-940, 2012.
24. Zou, H., Hastie, T., and Tibshirani, R. Sparse principal component analysis. Journal of computational and graphical statistics, 15(2):265-286, 2006. (Pubitemid 43935978)