Principal Component Analysis (PCA) is a common tool for dimensionality reduction and feature extraction, which has been applied in many fields, such as biology, medicine, machine learning and bioinformatics. But PCA has two obvious drawbacks: each principal component is line combination and loadings are non-zero which is hard to interpret. Sparse Principal Component Analysis (SPCA) was proposed to overcome these two disadvantages of PCA under the circumstances. This review paper will mainly focus on the research about SPCA, where the basic models of PCA and SPCA, various algorithms and extensions of SPCA are summarized. According to the difference of objective function and the constraint conditions, SPCA can be divided into three groups as it shown in Fig. 1. We also make a comparison among the different kind of sparse penalties. Besides, brief statements and other different classifications are summarized at last.
CITATION STYLE
Feng, C. M., Gao, Y. L., Liu, J. X., Zheng, C. H., Li, S. J., & Wang, D. (2016). A simple review of sparse principal components analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9772, pp. 374–383). Springer Verlag. https://doi.org/10.1007/978-3-319-42294-7_33
Mendeley helps you to discover research relevant for your work.