{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T14:41:45Z","timestamp":1776523305266,"version":"3.51.2"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319422930","type":"print"},{"value":"9783319422947","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42294-7_33","type":"book-chapter","created":{"date-parts":[[2016,7,11]],"date-time":"2016-07-11T15:00:47Z","timestamp":1468249247000},"page":"374-383","source":"Crossref","is-referenced-by-count":12,"title":["A Simple Review of Sparse Principal Components Analysis"],"prefix":"10.1007","author":[{"given":"Chun-Mei","family":"Feng","sequence":"first","affiliation":[]},{"given":"Ying-Lian","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Jin-Xing","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Chun-Hou","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Sheng-Jun","family":"Li","sequence":"additional","affiliation":[]},{"given":"Dong","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,12]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Liu, J.-X., Xu, Y., Gao, Y.-L., Zheng, C.-H., Wang, D., Zhu, Q.: A Class-Information-based Sparse Component Analysis Method to Identify Differentially Expressed Genes on RNA-Seq Data. 13(2), 392\u2013398 (2015)","DOI":"10.1109\/TCBB.2015.2440265"},{"key":"33_CR2","unstructured":"Richt\u00e1rik, P., Tak\u00e1\u010d, M., Ahipa\u015fao\u011flu, S.D.: Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes. arXiv preprint arXiv:1212.4137 (2012)"},{"issue":"6","key":"33_CR3","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1037\/h0071325","volume":"24","author":"H Hotelling","year":"1933","unstructured":"Hotelling, H.: Analysis of a complex of statistical variables into principal components. J. Educ. Psychol. 24(6), 417 (1933)","journal-title":"J. Educ. Psychol."},{"issue":"1","key":"33_CR4","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1080\/757584395","volume":"22","author":"IT Jolliffe","year":"1995","unstructured":"Jolliffe, I.T.: Rotation of principal components: choice of normalization constraints. J. Appl. Stat. 22(1), 29\u201335 (1995)","journal-title":"J. Appl. Stat."},{"issue":"2","key":"33_CR5","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1214\/13-AOS1097","volume":"41","author":"Z Ma","year":"2013","unstructured":"Ma, Z.: Sparse principal component analysis and iterative thresholding. Ann. Stat. 41(2), 772\u2013801 (2013)","journal-title":"Ann. Stat."},{"key":"33_CR6","unstructured":"Moghaddam, B., Weiss, Y., Avidan, S.: Spectral bounds for sparse PCA: Exact and greedy algorithms. In: Advances in neural information processing systems, pp. 915\u2013922 (2005)"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"d\u2019Aspremont, A., Bach, F.R., Ghaoui, L.E.: Full regularization path for sparse principal component analysis. In: Proceedings of the 24th international conference on Machine learning, pp. 177\u2013184. ACM (2007)","DOI":"10.1145\/1273496.1273519"},{"issue":"4","key":"33_CR8","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/s00180-008-0147-3","volume":"24","author":"A Farcomeni","year":"2009","unstructured":"Farcomeni, A.: An exact approach to sparse principal component analysis. Comput. Stat. 24(4), 583\u2013604 (2009)","journal-title":"Comput. Stat."},{"key":"33_CR9","unstructured":"Mackey, L.W.: Deflation methods for sparse PCA. In: Advances in Neural Information Processing Systems, pp. 1017\u20131024 (2009)"},{"issue":"1","key":"33_CR10","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s10444-011-9186-3","volume":"36","author":"Y Wang","year":"2012","unstructured":"Wang, Y., Wu, Q.: Sparse PCA by iterative elimination algorithm. Adv. Comput. Math. 36(1), 137\u2013151 (2012)","journal-title":"Adv. Comput. Math."},{"key":"33_CR11","unstructured":"Kuleshov, V.: Fast algorithms for sparse principal component analysis based on Rayleigh quotient iteration. In: Proceedings of the 30th International Conference on Machine Learning (ICML-13), pp. 1418\u20131425 (2013)"},{"key":"33_CR12","first-page":"517","volume":"11","author":"M Journ\u00e9e","year":"2010","unstructured":"Journ\u00e9e, M., Nesterov, Y., Richt\u00e1rik, P., Sepulchre, R.: Generalized power method for sparse principal component analysis. J. Mach. Learn. Res. 11, 517\u2013553 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"33_CR13","first-page":"899","volume":"14","author":"X-T Yuan","year":"2013","unstructured":"Yuan, X.-T., Zhang, T.: Truncated power method for sparse eigenvalue problems. J. Mach. Learn. Res. 14(1), 899\u2013925 (2013)","journal-title":"J. Mach. Learn. Res."},{"key":"33_CR14","unstructured":"Zhao, Q., Meng, D., Xu, Z.: A recursive divide-and-conquer approach for sparse principal component analysis. arXiv preprint, arXiv:1211.7219 (2012)"},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Zass, R., Shashua, A.: Nonnegative sparse PCA. In: Advances in Neural Information Processing Systems, pp. 1561\u20131568 (2006)","DOI":"10.7551\/mitpress\/7503.003.0200"},{"issue":"5","key":"33_CR16","doi-asserted-by":"crossref","first-page":"1949","DOI":"10.1109\/TSP.2011.2112653","volume":"59","author":"MO Ulfarsson","year":"2011","unstructured":"Ulfarsson, M.O., Solo, V.: Vector sparse variable PCA. IEEE Trans. Sig. Process. 59(5), 1949\u20131958 (2011)","journal-title":"IEEE Trans. Sig. Process."},{"issue":"3","key":"33_CR17","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1198\/1061860032148","volume":"12","author":"IT Jolliffe","year":"2003","unstructured":"Jolliffe, I.T., Trendafilov, N.T., Uddin, M.: A modified principal component technique based on the LASSO. J. Comput. Graph. Stat. 12(3), 531\u2013547 (2003)","journal-title":"J. Comput. Graph. Stat."},{"key":"33_CR18","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. Roy. Stat. Soc. Ser. B (Methodological) 58, 267\u2013288 (1996)","journal-title":"J. Roy. Stat. Soc. Ser. B (Methodological)"},{"issue":"3","key":"33_CR19","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1137\/050645506","volume":"49","author":"A d\u2019Aspremont","year":"2007","unstructured":"d\u2019Aspremont, A., El Ghaoui, L., Jordan, M.I., Lanckriet, G.R.: A direct formulation for sparse PCA using semidefinite programming. SIAM Rev. 49(3), 434\u2013448 (2007)","journal-title":"SIAM Rev."},{"key":"33_CR20","first-page":"1269","volume":"9","author":"A d\u2019Aspremont","year":"2008","unstructured":"d\u2019Aspremont, A., Bach, F., Ghaoui, L.E.: Optimal solutions for sparse principal component analysis. J. Mach. Learn. Res. 9, 1269\u20131294 (2008)","journal-title":"J. Mach. Learn. Res."},{"issue":"1\u20132","key":"33_CR21","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s10107-011-0452-4","volume":"135","author":"Z Lu","year":"2012","unstructured":"Lu, Z., Zhang, Y.: An augmented Lagrangian approach for sparse principal component analysis. Math. Program. 135(1\u20132), 149\u2013193 (2012)","journal-title":"Math. Program."},{"issue":"4","key":"33_CR22","doi-asserted-by":"crossref","first-page":"930","DOI":"10.1198\/jcgs.2010.08127","volume":"19","author":"J Guo","year":"2012","unstructured":"Guo, J., James, G., Levina, E., Michailidis, G., Zhu, J.: Principal component analysis with sparse fused loadings. J. Comput. Graph. Stat. 19(4), 930\u2013946 (2012)","journal-title":"J. Comput. Graph. Stat."},{"key":"33_CR23","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.jmva.2012.07.004","volume":"114","author":"X Qi","year":"2013","unstructured":"Qi, X., Luo, R., Zhao, H.: Sparse principal component analysis by choice of norm. J. Multivar. Anal. 114, 127\u2013160 (2013)","journal-title":"J. Multivar. Anal."},{"key":"33_CR24","unstructured":"Hein, M., B\u00fchler, T.: An inverse power method for nonlinear eigenproblems with applications in 1-spectral clustering and sparse PCA. In: Advances in Neural Information Processing Systems, pp. 847\u2013855 (2010)"},{"issue":"2","key":"33_CR25","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1198\/106186006X113430","volume":"15","author":"H Zou","year":"2006","unstructured":"Zou, H., Hastie, T., Tibshirani, R.: Sparse principal component analysis. J. Comput. Graph. Stat. 15(2), 265\u2013286 (2006)","journal-title":"J. Comput. Graph. Stat."},{"key":"33_CR26","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1198\/jcgs.2009.0012","volume":"18","author":"C Leng","year":"2012","unstructured":"Leng, C., Wang, H.: On general adaptive sparse principal component analysis. J. Comput. Graph. Stat. 18, 201\u2013215 (2012)","journal-title":"J. Comput. Graph. Stat."},{"key":"33_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/978-3-319-03680-9_16","volume-title":"AI 2013: Advances in Artificial Intelligence","author":"S Xiaoshuang","year":"2013","unstructured":"Xiaoshuang, S., Zhihui, L., Zhenhua, G., Minghua, W., Cairong, Z., Heng, K.: Sparse Principal Component Analysis via Joint L 2, 1-Norm Penalty. In: Cranefield, S., Nayak, A. (eds.) AI 2013. LNCS, vol. 8272, pp. 148\u2013159. Springer, Heidelberg (2013)"},{"key":"33_CR28","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1093\/biostatistics\/kxp008","volume":"10","author":"DM Witten","year":"2009","unstructured":"Witten, D.M., Tibshirani, R., Hastie, T.: A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis. Biostatistics 10, 515\u2013534 (2009). kxp008","journal-title":"Biostatistics"},{"issue":"6","key":"33_CR29","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1016\/j.jmva.2007.06.007","volume":"99","author":"H Shen","year":"2008","unstructured":"Shen, H., Huang, J.Z.: Sparse principal component analysis via regularized low rank matrix approximation. J. Multivar. Anal. 99(6), 1015\u20131034 (2008)","journal-title":"J. Multivar. Anal."},{"key":"33_CR30","unstructured":"Papailiopoulos, D.S., Dimakis, A.G., Korokythakis, S.: Sparse PCA through low-rank approximations. arXiv preprint, arXiv:1303.0551 (2013)"},{"issue":"1","key":"33_CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/1471-2105-11-1","volume":"11","author":"D Lee","year":"2010","unstructured":"Lee, D., Lee, W., Lee, Y., Pawitan, Y.: Super-sparse principal component analyses for high-throughput genomic data. BMC Bioinformatics 11(1), 1 (2010)","journal-title":"BMC Bioinformatics"},{"issue":"1","key":"33_CR32","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1016\/j.patcog.2011.07.009","volume":"45","author":"D Meng","year":"2012","unstructured":"Meng, D., Zhao, Q., Xu, Z.: Improve robustness of sparse PCA by L 1-norm maximization. Pattern Recogn. 45(1), 487\u2013497 (2012)","journal-title":"Pattern Recogn."},{"key":"33_CR33","unstructured":"Jenatton, R., Obozinski, G., Bach, F.: Structured sparse principal component analysis. arXiv preprint arXiv:0909.1440 (2009)"},{"key":"33_CR34","unstructured":"Tipping, M.E., Nh, C.C.: Sparse kernel principal component analysis (2001)"},{"key":"33_CR35","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/978-3-0348-0490-5_20","volume-title":"High dimensional probability VI","author":"K Lounici","year":"2013","unstructured":"Lounici, K.: Sparse principal component analysis with missing observations. In: Houdr\u00e9, C., Mason, D.M., Rosi\u0144ski, J., Wellner, J.A. (eds.) High dimensional probability VI, vol. 66, pp. 327\u2013356. Springer, Heidelberg (2013)"},{"key":"33_CR36","doi-asserted-by":"crossref","unstructured":"Asteris, M., Papailiopoulos, D.S., Karystinos, G.N.: Sparse principal component of a rank-deficient matrix. In: IEEE International Symposium on 2011 Information Theory Proceedings (ISIT), pp. 673\u2013677. IEEE (2011)","DOI":"10.1109\/ISIT.2011.6034216"},{"key":"33_CR37","doi-asserted-by":"crossref","unstructured":"Liu, W., Zhang, H., Tao, D., Wang, Y., Lu, K.: Large-scale paralleled sparse principal component analysis. Multimedia Tools Appl. 1\u201313 (2014)","DOI":"10.1007\/s11042-014-2004-4"},{"key":"33_CR38","doi-asserted-by":"crossref","unstructured":"Xiao, C.: Two-dimensional sparse principal component analysis for face recognition. In: 2010 2nd International Conference on Future Computer and Communication (ICFCC), pp. V2\u2013561-V562-565. IEEE (2010)","DOI":"10.1109\/ICFCC.2010.5497525"},{"issue":"10","key":"33_CR39","doi-asserted-by":"crossref","first-page":"1942","DOI":"10.1109\/TNNLS.2013.2297381","volume":"25","author":"Z Lai","year":"2014","unstructured":"Lai, Z., Xu, Y., Chen, Q., Yang, J., Zhang, D.: Multilinear sparse principal component analysis. IEEE Trans. Neural Netw. Learn. Syst. 25(10), 1942\u20131950 (2014)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"33_CR40","unstructured":"Sharp, K., Rattray, M.: Dense message passing for sparse principal component analysis. In: International Conference on Artificial Intelligence and Statistics, pp. 725\u2013732 (2010)"},{"key":"33_CR41","unstructured":"Wang, S.-J., Sun, M.-F., Chen, Y.-H., Pang, E.-P., Zhou, C.-G.: STPCA: sparse tensor principal component analysis for feature extraction. In: 21st International Conference on 2012 Pattern Recognition (ICPR), pp. 2278\u20132281. IEEE (2012)"},{"key":"33_CR42","doi-asserted-by":"crossref","unstructured":"Jiang, R., Fei, H., Huan, J.: Anomaly localization for network data streams with graph joint sparse PCA. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 886\u2013894. ACM (2011)","DOI":"10.1145\/2020408.2020557"},{"issue":"4","key":"33_CR43","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1016\/j.jprocont.2012.02.003","volume":"22","author":"M Grbovic","year":"2012","unstructured":"Grbovic, M., Li, W., Xu, P., Usadi, A.K., Song, L., Vucetic, S.: Decentralized fault detection and diagnosis via sparse PCA based decomposition and Maximum Entropy decision fusion. J. Process Control 22(4), 738\u2013750 (2012)","journal-title":"J. Process Control"},{"key":"33_CR44","doi-asserted-by":"crossref","unstructured":"Johnstone, I.M., Lu, A.Y.: On consistency and sparsity for principal components analysis in high dimensions. J. Am. Stat. Assoc. 104 (2012)","DOI":"10.1198\/jasa.2009.0121"},{"key":"33_CR45","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/j.jmva.2012.10.007","volume":"115","author":"D Shen","year":"2013","unstructured":"Shen, D., Shen, H., Marron, J.S.: Consistency of sparse PCA in high dimension, low sample size contexts. J. Multivar. Anal. 115, 317\u2013333 (2013)","journal-title":"J. Multivar. Anal."},{"issue":"6","key":"33_CR46","doi-asserted-by":"crossref","first-page":"3074","DOI":"10.1214\/13-AOS1178","volume":"41","author":"TT Cai","year":"2013","unstructured":"Cai, T.T., Ma, Z., Wu, Y.: Sparse PCA: Optimal rates and adaptive estimation. Ann. Stat. 41(6), 3074\u20133110 (2013)","journal-title":"Ann. Stat."},{"issue":"1","key":"33_CR47","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.orl.2010.11.005","volume":"39","author":"R Luss","year":"2011","unstructured":"Luss, R., Teboulle, M.: Convex approximations to sparse PCA via Lagrangian duality. Oper. Res. Lett. 39(1), 57\u201361 (2011)","journal-title":"Oper. Res. Lett."},{"key":"33_CR48","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1007\/978-1-4614-0769-0_31","volume-title":"Handbook on Semidefinite, Conic and Polynomial Optimization","author":"Y Zhang","year":"2012","unstructured":"Zhang, Y., d\u2019Aspremont, A., El Ghaoui, L.: Sparse PCA: Convex relaxations, algorithms and applications. In: Anjos, M.F., Lasserre, J.B. (eds.) Handbook on Semidefinite, Conic and Polynomial Optimization, vol. 166, pp. 915\u2013940. Springer, Heidelberg (2012)"},{"key":"33_CR49","first-page":"3383","volume":"2014","author":"Z Wang","year":"2014","unstructured":"Wang, Z., Lu, H., Liu, H.: Tighten after relax: Minimax-optimal sparse PCA in polynomial time. Adv. Neural Inf. Process. Syst. 2014, 3383\u20133391 (2014)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"2","key":"33_CR50","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1214\/14-AOS1268","volume":"43","author":"C Gao","year":"2015","unstructured":"Gao, C., Zhou, H.H.: Rate-optimal posterior contraction for sparse PCA. Ann. Stat. 43(2), 785\u2013818 (2015)","journal-title":"Ann. Stat."},{"key":"33_CR51","unstructured":"Johnstone, I.M., Lu, A.Y.: Sparse principal components analysis. Unpublished manuscript 7 (2004)"},{"issue":"12","key":"33_CR52","doi-asserted-by":"crossref","first-page":"5823","DOI":"10.1109\/TSP.2008.2006587","volume":"56","author":"MO Ulfarsson","year":"2008","unstructured":"Ulfarsson, M.O., Solo, V.: Sparse variable PCA using geodesic steepest descent. IEEE Trans. Sig. Process. 56(12), 5823\u20135832 (2008)","journal-title":"IEEE Trans. Sig. Process."}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Application"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42294-7_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,18]],"date-time":"2024-06-18T05:28:35Z","timestamp":1718688515000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42294-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319422930","9783319422947"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42294-7_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}