{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T19:22:23Z","timestamp":1767900143026,"version":"3.49.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,6,12]],"date-time":"2017-06-12T00:00:00Z","timestamp":1497225600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s10115-017-1069-6","type":"journal-article","created":{"date-parts":[[2017,6,12]],"date-time":"2017-06-12T03:51:54Z","timestamp":1497239514000},"page":"541-565","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Three iteratively reweighted least squares algorithms for $$L_1$$ L 1 -norm principal component analysis"],"prefix":"10.1007","volume":"54","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0722-7729","authenticated-orcid":false,"given":"Young Woong","family":"Park","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diego","family":"Klabjan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,12]]},"reference":[{"key":"1069_CR1","doi-asserted-by":"crossref","unstructured":"Baccini A, Besse P, de\u00a0Faguerolles A (March 1996) A $$L_1$$ L 1 -norm PCA and a heuristic approach. In: Proceedings of the international conference on ordinal and symbolic data analysis, pp 359\u2013368","DOI":"10.1007\/978-3-642-61159-9_32"},{"key":"1069_CR2","unstructured":"Bache K, Lichman M (2013) UCI Machine Learning Repository"},{"key":"1069_CR3","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.csda.2012.11.007","volume":"61","author":"J Brooks","year":"2013","unstructured":"Brooks J, Dula J, Boone E (2013) A pure $$L_1$$ L 1 -norm principal component analysis. Comput Stat Data Anal 61:83\u201398","journal-title":"Comput Stat Data Anal"},{"key":"1069_CR4","unstructured":"Brooks J, Jot S (2012) pcaL1: An implementation in R of three methods for $$L_1$$ L 1 -norm principal component analysis. Optimization Online"},{"issue":"3","key":"1069_CR5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/1970392.1970395","volume":"58","author":"EJ Cand\u00e9s","year":"2011","unstructured":"Cand\u00e9s EJ, Li X, Ma Y, Wright J (2011) Robust principal component analysis? J ACM 58(3):11","journal-title":"J ACM"},{"issue":"6","key":"1069_CR6","doi-asserted-by":"crossref","first-page":"1441","DOI":"10.1016\/j.csda.2005.01.009","volume":"50","author":"V Choulakian","year":"2006","unstructured":"Choulakian V (2006) $$L_1$$ L 1 -norm projection pursuit principal component analysis. Comput Stat Data Anal 50(6):1441\u20131451","journal-title":"Comput Stat Data Anal"},{"issue":"1","key":"1069_CR7","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/j.jmva.2004.08.002","volume":"95","author":"C Croux","year":"2005","unstructured":"Croux C, Ruiz-Gazen A (2005) High breakdown estimators for principal components: the projection-pursuit approach revisited. J Multivar Anal 95(1):206\u2013226","journal-title":"J Multivar Anal"},{"issue":"1","key":"1069_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/cpa.20303","volume":"63","author":"I Daubechies","year":"2010","unstructured":"Daubechies I, DeVore R, Fornasier M, Gntrk CS (2010) Iteratively reweighted least squares minimization for sparse recovery. Commun Pure Appl Math 63(1):1\u201338","journal-title":"Commun Pure Appl Math"},{"issue":"4","key":"1069_CR9","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0167-9473(87)90054-5","volume":"5","author":"J Galpin","year":"1987","unstructured":"Galpin J, Hawkins D (1987) Methods of $$L_1$$ L 1 estimation of a covariance matrix. Comput Stat Data Anal 5(4):305\u2013319","journal-title":"Comput Stat Data Anal"},{"key":"1069_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0003-2670(86)80028-9","volume":"185","author":"P Geladi","year":"1986","unstructured":"Geladi P, Kowalski BR (1986) Partial least-squares regression: a tutorial. Anal Chim Acta 185:1\u201317","journal-title":"Anal Chim Acta"},{"issue":"2","key":"1069_CR11","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1137\/090771806","volume":"53","author":"N Halko","year":"2011","unstructured":"Halko N, Martinsson PG, Tropp JA (2011) Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions. SIAM Rev 53(2):217\u2013288","journal-title":"SIAM Rev"},{"key":"1069_CR12","volume-title":"Principal component analysis","author":"I Jolliffe","year":"2002","unstructured":"Jolliffe I (2002) Principal component analysis. Springer, New York"},{"key":"1069_CR13","volume-title":"Iteratively reweighted least squares","author":"M Jorgensen","year":"2006","unstructured":"Jorgensen M (2006) Iteratively reweighted least squares. Wiley, New York"},{"key":"1069_CR14","unstructured":"Jot S, Brooks P, Visentin A, Park YW (2016) pcaL1: $$L_1$$ L 1 -norm PCA methods. R package version 1.4.1"},{"key":"1069_CR15","doi-asserted-by":"crossref","unstructured":"Ke Q, Kanade T (June 2005) Robust $$L_1$$ L 1 norm factorization in the presence of outliers and missing data by alternative convex programming. In: Proceedings of the 2005 IEEE computer society conference on computer vision and pattern recognition, pp 739\u2013746","DOI":"10.1109\/CVPR.2005.309"},{"issue":"9","key":"1069_CR16","doi-asserted-by":"crossref","first-page":"1672","DOI":"10.1109\/TPAMI.2008.114","volume":"30","author":"N Kwak","year":"2008","unstructured":"Kwak N (2008) Principal component analysis based on $$L_1$$ L 1 -norm maximization. IEEE Trans Pattern Anal Mach Intell 30(9):1672\u20131680","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1069_CR17","volume-title":"Linear algebra and its applications","author":"PD Lax","year":"2007","unstructured":"Lax PD (2007) Linear algebra and its applications. Wiley, Hoboken"},{"issue":"391","key":"1069_CR18","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1080\/01621459.1985.10478181","volume":"80","author":"G Li","year":"1985","unstructured":"Li G, Chen Z (1985) Projection-pursuit approach to robust dispersion matrices and principal components: primary theory and monte carlo. J Am Stat Assoc 80(391):759\u2013766","journal-title":"J Am Stat Assoc"},{"issue":"19","key":"1069_CR19","doi-asserted-by":"crossref","first-page":"5046","DOI":"10.1109\/TSP.2014.2338077","volume":"62","author":"PP Markopoulos","year":"2014","unstructured":"Markopoulos PP, Karystinos GN, Pados DA (2014) Optimal algorithms for $$L_1$$ L 1 -subspace signal processing. IEEE Trans Signal Process 62(19):5046\u20135058","journal-title":"IEEE Trans Signal Process"},{"key":"1069_CR20","doi-asserted-by":"crossref","first-page":"1123","DOI":"10.1214\/11-EJS636","volume":"5","author":"M McCoy","year":"2011","unstructured":"McCoy M, Tropp JA (2011) Two proposals for robust PCA using semidefinite programming. Electron J Stat 5:1123\u20131160","journal-title":"Electron J Stat"},{"key":"1069_CR21","unstructured":"Nie F, Huang H, Ding C, Luo D, Wang H (June 2011) Robust principal component analysis with non-greedy $$L_1$$ L 1 -norm maximization. In: Proceeding of 22nd international conference on artificial intelligence, pp 1433\u20131438"},{"key":"1069_CR22","unstructured":"Park YW, Klabjan D (2016) Iteratively reweighted least squares algorithms for $$L_1$$ L 1 -norm principal component analysis. In 2016 IEEE international conference on data mining, Barcelona"},{"key":"1069_CR23","unstructured":"Roweis S (1998) EM Algorithms for PCA and SPCA. In: Advances in neural information processing systems, pp 626\u2013632"},{"key":"1069_CR24","unstructured":"R Core Team (2014) R: A language and environment for statistical computing. R Foundation for Statistical Computing, Vienna, Austria"},{"key":"1069_CR25","doi-asserted-by":"crossref","first-page":"1356","DOI":"10.1016\/j.laa.2012.04.035","volume":"437","author":"Y Shmueli","year":"2012","unstructured":"Shmueli Y, Wolf G, Averbuch A (2012) Updating kernel methods in spectral decomposition by affinity perturbations. Linear Algebra Appl 437:1356\u20131365","journal-title":"Linear Algebra Appl"},{"issue":"1\u20132","key":"1069_CR26","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s10107-012-0584-1","volume":"142","author":"Z Wen","year":"2013","unstructured":"Wen Z, Yin W (2013) A feasible method for optimization with orthogonality constraints. Math Program 142(1\u20132):397\u2013434","journal-title":"Math Program"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-017-1069-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-017-1069-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-017-1069-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T03:27:41Z","timestamp":1750303661000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-017-1069-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,12]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["1069"],"URL":"https:\/\/doi.org\/10.1007\/s10115-017-1069-6","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6,12]]}}}