Sparse principal component analysis with missing observations

High Dimensional Probability VI: The Banff Volume

Volumn , Issue , 2013, Pages 327-356

  Lounici, Karim ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Information theoretic lower bounds; Low rank covariance matrix; Missing observations; Oracle inequalities; Sparse principal component analysis

Indexed keywords

EID: 85015082750     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-0348-0490-5     Document Type: Chapter

References (19)

1. Q. Berthet and P. Rigollet. Optimal detection of sparse principal components in high dimension. ArXiv:1202.5070 (2012).
2. A. d'Aspremont, F. Bach, and L. El Ghaoui. Optimal solutions for sparse principal component analysis. Journal of Machine Learning Research 9 (2008), 1269-1294.
3. M. Hourani and I.M.M. El Emary. Microarray missing values imputation methods: Critical analysis review. Comput. Sci. Inf. Syst. 6(2) (2009), 165-190.
4. I.M. Johnstone and A.Y. Lu. On consistency and sparsity for principal components analysis in high dimensions. J. Amer. Statist. Assoc. 104(486) (2009), 682-693.
5. I.T. Jolliffe, N.T. Trendafilov, and M. Uddin. A modified principal component technique based on the LASSO. J. Comput. Graph. Statist. 12(3) (2003), 531-547.
6. R. Jornsten, H.Y. Wang, W.J. Welsh, and M. Ouyang. Dna microarray data imputation and significance analysis of differential expression. Bioinformatics 21(22) (2005), 4155-4161.
7. M. Journée, Y. Nesterov, P. Richtarik, and R. Sepulchre. Generalized power method for sparse principal component analysis. J. Mach. Learn. Res. 11 (2010), 517-553.
8. K. Lounici. High dimensional covariance matrix estimation with missing observations. ArXiv:1201.2577 (2012).
9. P. Massart. Concentration inequalities and model selection, volume 1896 of Lecture Notes in Mathematics. Springer, Berlin, 2007. Lectures from the 33rd Summer School on Probability Theory held in Saint-Flour, July 6-23, 2003, with a foreword by Jean Picard.
10. B. Moghaddam, Y. Weiss, and S. Avidan. Spectral bounds for sparse pcaExact and greedy algorithms. In Y. Weiss, B. Schölkopf, and J. Platt, editors, Advances in Neural Information Processing Systems 18, 915-922. MIT Press, Cambridge, MA, 2006.
11. B. Nadler. Finite sample approximation results for principal component analysis: a matrix perturbation approach. Ann. Statist. 36(6) (2008), 2791-2817.
12. D. Paul. Asymptotics of sample eigenstructure for a large dimensional spiked covariance model. Statist. Sinica 17(4) (2007), 1617-1642.
13. D. Paul and I. Johnstone. Sparse principal component analysis for high dimensional data. ArXiv:1202.1242 (2007).
14. H. Shen and J.Z. Huang. Sparse principal component analysis via regularized low rank matrix approximation. Multivariate Anal. 99(6) (2008), 1015-1034.
15. A.B. Tsybakov. Introduction to nonparametric estimation. Springer Series in Statistics. Springer, New York, 2009. Revised and extended from the 2004 French original, translated by Vladimir Zaiats.
16. R. Vershynin. Introduction to the non-asymptotic analysis of random matrices. ArXiv:1011.3027v7 (2011).
17. V.Q. Vu and J. Lei. Minimax rates of estimation for sparse pca in high dimensions. In 15th International Conference on Artificial Intelligence and Statistics (AISTATS) (2012).
18. M. Zongming. Sparse principal component analysis and iterative thresholding. ArXiv:1112.2432 (2011).
19. H. Zou, T. Hastie, and R. Tibshirani. Sparse principal component analysis. J. Com- put. Graph. Statist. 15(2) (2006), 265-286.