{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:02:52Z","timestamp":1740135772406,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2022,3,2]],"date-time":"2022-03-02T00:00:00Z","timestamp":1646179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,2]],"date-time":"2022-03-02T00:00:00Z","timestamp":1646179200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11771347","91730306"],"award-info":[{"award-number":["11771347","91730306"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["41390454"],"award-info":[{"award-number":["41390454"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Circuits Syst Signal Process"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s00034-022-01991-y","type":"journal-article","created":{"date-parts":[[2022,3,2]],"date-time":"2022-03-02T08:05:46Z","timestamp":1646208346000},"page":"4570-4580","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A General Null Space Property for Sparse Principal Component Analysis"],"prefix":"10.1007","volume":"41","author":[{"given":"Xuanli","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7207-3183","authenticated-orcid":false,"given":"Jigen","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angang","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fujun","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kexue","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,2]]},"reference":[{"key":"1991_CR1","volume-title":"Principal Component Analysis","author":"IT Jolliffe","year":"2002","unstructured":"I.T. Jolliffe, Principal Component Analysis, 2nd edn. (Springer, New York, 2002)","edition":"2"},{"issue":"7","key":"1991_CR2","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/j.ifacol.2016.07.259","volume":"49","author":"S Gajjar","year":"2016","unstructured":"S. Gajjar, M. Kulahci, A. Palazoglu, Use of sparse principal component analysis (SPCA) for fault detection. IFAC-PapersOnLine 49(7), 693\u2013698 (2016)","journal-title":"IFAC-PapersOnLine"},{"key":"1991_CR3","first-page":"1269","volume":"9","author":"A D\u2019Aspremont","year":"2008","unstructured":"A. D\u2019Aspremont, F. Bach, L.E. Ghaoui, Optimal solutions for sparse principal component analysis. J. Mach. Learn. Res. 9, 1269\u20131294 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"1991_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jmva.2018.02.002","volume":"166","author":"K Fang","year":"2018","unstructured":"K. Fang, X. Fan, Q. Zhang, S. Ma, Integrative sparse principal component analysis. J. Multivar. Anal. 166, 1\u201316 (2018)","journal-title":"J. Multivar. Anal."},{"issue":"3","key":"1991_CR5","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1198\/1061860032148","volume":"12","author":"IT Jolliffe","year":"2003","unstructured":"I.T. Jolliffe, N.T. Trendafilov, M. Uddin, A modified principal component technique based on the lasso. J. Comput. Graph. Stat. 12(3), 531\u2013547 (2003)","journal-title":"J. Comput. Graph. Stat."},{"issue":"3","key":"1991_CR6","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1137\/050645506","volume":"49","author":"A D\u2019Aspremont","year":"2007","unstructured":"A. D\u2019Aspremont, L.E. Ghaoui, M.I. Jordan, G.R.G. Lanckriet, A direct formulation for sparse PCA using semidefinite programming. SIAM Rev. 49(3), 434\u2013448 (2007)","journal-title":"SIAM Rev."},{"issue":"6","key":"1991_CR7","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1016\/j.jmva.2007.06.007","volume":"99","author":"H Shen","year":"2008","unstructured":"H. Shen, J.Z. Huang, Sparse principal component analysis via regularized low rank matrix approximation. J. Multivar. Anal. 99(6), 1015\u20131034 (2008)","journal-title":"J. Multivar. Anal."},{"issue":"2008070","key":"1991_CR8","first-page":"517","volume":"11","author":"M Journ\u00e9e","year":"2010","unstructured":"M. Journ\u00e9e, Y. Nesterov, P. Richtrik, R. Sepulchre, Generalized power method for sparse principal component analysis. Core Discuss. Pap. 11(2008070), 517\u2013553 (2010)","journal-title":"Core Discuss. Pap."},{"key":"1991_CR9","doi-asserted-by":"crossref","unstructured":"C. Sigg, J.M. Buhmann, Expectation-maximization for sparse and non-negative PCA, in Proceedings of 25th International Conference on Machine Learning (ICML), ACM, 960\u2013967 (2008)","DOI":"10.1145\/1390156.1390277"},{"issue":"2","key":"1991_CR10","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1111\/j.1467-9868.2005.00503.x","volume":"67","author":"H Zou","year":"2005","unstructured":"H. Zou, T. Hastie, Regularization and variable selection via the elastic net. J. R. Stat. Soc. 67(2), 301\u2013320 (2005)","journal-title":"J. R. Stat. Soc."},{"key":"1991_CR11","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1198\/106186006X113430","volume":"15","author":"H Zou","year":"2004","unstructured":"H. Zou, T. Hastie, R. Tibshirani, Sparse principal component analysis. J. Comput. Graph. Stat. 15, 265\u2013286 (2004)","journal-title":"J. Comput. Graph. Stat."},{"key":"1991_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4948-7","volume-title":"A Mathematical Introduction to Compressive Sensing","author":"S Foucart","year":"2013","unstructured":"S. Foucart, H. Rauhut, A Mathematical Introduction to Compressive Sensing (Springer, New York, 2013)"},{"issue":"1","key":"1991_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/S003614450037906X","volume":"43","author":"SS Chen","year":"2001","unstructured":"S.S. Chen, D.L. Donoho, M.A. Saunders, Atomic decomposition by basis pursuit. SIAM Rev. 43(1), 129\u2013159 (2001)","journal-title":"SIAM Rev."}],"container-title":["Circuits, Systems, and Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-022-01991-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00034-022-01991-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-022-01991-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,22]],"date-time":"2022-06-22T16:39:20Z","timestamp":1655915960000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00034-022-01991-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,2]]},"references-count":13,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["1991"],"URL":"https:\/\/doi.org\/10.1007\/s00034-022-01991-y","relation":{},"ISSN":["0278-081X","1531-5878"],"issn-type":[{"type":"print","value":"0278-081X"},{"type":"electronic","value":"1531-5878"}],"subject":[],"published":{"date-parts":[[2022,3,2]]},"assertion":[{"value":"5 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there are no known conflicts of interest associated with this publication.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}