Fetching the paper…
Reading the bibliography…
Given a multivariate data set, sparse principal component analysis (SPCA) aims to extract several linear combinations of the variables that together explain the variance in the data as much as possible, while controlling the number of nonzero loadings in these combinations.
Jollife I (1986) Principal component analysis. Springer Verlag, NY
1986
Earlier work this paper cites.
Jolliffe IT, Trendafilov NT, Uddin M (2003) A modified principal component technique based on the LASSO. Journal of Computational and Graphical Statistics 12(3):531–547
2003
Earlier work this paper cites.
Moghaddam B, Weiss Y, Avidan S (2006) Spectral bounds for sparse PCA: Exact and greedy algorithms. In: Weiss Y, Schölkopf B, Platt J (eds) Advances in Neural Information Processing Systems, MIT Press, Cambridge, MA, vol 18, pp 915–922
2006
Earlier work this paper cites.
Trendafilov NT, Jolliffe IT (2006) Projected gradient approach to the numerical solution of the scotlass. Journal of Computational Statistics and Data Analysis 50:242–253
2006
Earlier work this paper cites.
Zou H, Hastie T, Tibshirani R (2006) Sparse principal component analysis. Journal of Computational and Graphical Statistics 15(2):265–286
2006
Earlier work this paper cites.
d’Aspremont A, El Ghaoui L, Jordan MI, Lanckriet G (2007) A direct formulation for sparse PCA using semidefinite programming. SIAM Review 49:434–448
2007
Earlier work this paper cites.
d’Aspremont A, Bach F, El Ghaoui L (2008) Optimal solutions for sparse principal component analysis. Journal of Machine Learning Research 9:1269–1294
2008
Earlier work this paper cites.
Kwak N (2008) Principal component analysis based on l 1 l_{1} norm maximization. IEEE Transactions on Pattern Analysis and Machine Intelligence 30:1672–1680
2008
Earlier work this paper cites.
Mackey L (2008) Deflation methods for sparse PCA. In: Advances in Neural Information Processing Systems (NIPS), vol 21, pp 1017–1024
2008
Earlier work this paper cites.
Shen H, Huang JZ (2008) Sparse principal component analysis via regularized low rank matrix approximation. Journal of Multivariate Analysis 99(6):1015–1034
2008
Earlier work this paper cites.
Amini AA, Wainwright MJ (2009) High-dimensional analysis of semidefinite relaxations for sparse principal components. Annals of Statistics 37:2877–2921
2009
Earlier work this paper cites.
Witten DM, Tibshirani R, Hastie T (2009) A penalized matrix decomposition, with applicaitons to sparse principal components and canonical correlation analysis. Biostatistics 10:515–534
2009
Cited alongside, same era.
Bah B, Tanner J (2010) Improved bounds on restricted isometry constants for gaussian matrices. SIAM Journal on Matrix Analysis and Applications 31:2882–2898
2010
Cited alongside, same era.
Journée M, Nesterov Y, Richtárik P, Sepulchre R (2010) Generalized power method for sparse principal component analysis. Journal of Machine Learning Research 11:517–553
2010
Cited alongside, same era.
Candès EJ, Li X, Ma Y, Wright J (2011) Robust principal component analysis? Journal of the ACM (JACM) 58:Article 11
2011
Cited alongside, same era.
Richtárik P (2011) Finding sparse approximations to extreme eigenvectors: generalized power method for sparse PCA and extensions. In: Proceedings of Signal Processing with Adaptive Sparse Structured Representations
Vu VQ, Lei J (2013) Minimax sparse principal subspace estimation in high dimensions. Annals of Statistics 41:2905–2947
2013
Closest in time.
Vu VQ, Cho J, Lei J, Rohe K (2013) Fantope projection and selection: A near-optimal convex relaxation of sparse PCA. In: Burges CJC, Bottou L, Welling M, Ghahramani Z, Weinberger KQ (eds) Advances in Neural Information Processing Systems, Curran Associates, Red Hook, NY, vol 26, pp 2670–2678
2013
Closest in time.
Hastie T, Tibshirani R, Wainwright M (2015) Statistical Learning with Sparsity: The Lasso and Generalizations. Chapman and Hall/CRC
2015
Closest in time.
Lei J, Vu VQ (2015) Sparsity and agnostic inference in sparse pca. The Annals of Statistics 43:299–322
2015
Closest in time.
Aravkin A, Becker S (2016) Dual smoothing and value function techniques for variational matrix decomposition. Handbook of Robust Low-Rank and Sparse Matrix Decomposition: Applications in Image and Video Processing
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2011
Cited alongside, same era.
Zhang Y, El Ghaoui L (2011) Large-scale sparse principal component analysis with application to text data. In: Advances in Neural Information Processing Systems (NIPS), vol 24, pp 532–539
2011
Cited alongside, same era.
Lu Z, Zhang Y (2012) An augmented Lagrangian approach for sparse principal component analysis. Mathematical Programming, Series A 135:149–193, DOI DOI:10.1007/s10107-011-0452-4
2012
Cited alongside, same era.
Meng D, Zhao Q, Xu Z (2012) Improve robustness of sparse PCA by l 1 l_{1} -norm maximization. Pattern Recognition 45:487–497
2012
Cited alongside, same era.
Croux C, Filzmoser P, Fritz H (2013) Robust sparse principal component analysis. Technometrics 55:202–214
2013
Cited alongside, same era.
Luss R, Teboulle M (2013) Conditional gradient algorithms for rank-one matrix approximations with a sparsity constraint. SIAM Review 55:65–98
2013
Cited alongside, same era.
Qi X, Luo R, Zhao H (2013) Sparse principal component analysis by choice of norm. Journal of Multivariate Analysis 114:127–160
2013
Cited alongside, same era.
2016
Closest in time.
Beck A, Vaisbourd Y (2016) The sparse principal component analysis problem: optimality conditions and algorithms. Journal of Optimization Theory and Algorithms 170:119–143
2016
Closest in time.
Hubert M, Reynkens T, Schmitt E, Verdonck T (2016) Sparse PCA for high-dimensional data with outliers. Technometrics 58:424–434
2016
Closest in time.
Trendafilov NT (2016) From simple structure to sparse components: a review. Computational Statistics 29:431–454
2016
Closest in time.
Bouwmans T, Sobral A, Javed S, Jung SK, Zahzah EH (2017) Decomposition into low-rank plus additive matrices for background/foreground separation: A review for a comparative evaluation with a large-scale dataset. Computer Science Review 23:1–71
2017
Closest in time.
Magdon-Ismail M (2017) Np-hardness and inapproximability of sparse PCA. Information Processing Letters 126:35–38
2017
Closest in time.
Berk L, Bertsimas D (2019) Certifiably optimal sparse principal component analysis. Mathematical Programming Computations 11:381–420
2019
Closest in time.