On principal component analysis in L₁.
From MaRDI portal
Publication:1614834
Four formulations of principal component analysis in \(L_{1}\) norm were developed by Galpin and Hawkins (Comput. Statist. Data Anal. 5 (1987) 305), QPmax, QPmin, LPmax, and LPmin. Choulakian (Comput. Statist. Data Anal. 37 (2001)135) claimed that of the four formulations, only QPmax produces a non-trivial solution. The objective is to present counter-examples that illustrate that the QPmin and LPmin formulations also give non-trivial solutions that may be unique except for the sign.
Recommendations
- A pure \(L_1\)-norm principal component analysis
- scientific article; zbMATH DE number 1824230
- Principal component analysis for α-stable vectors
- scientific article; zbMATH DE number 2062641
- L1-Norm Principal-Component Analysis of Complex Data
- L1-norm projection pursuit principal component analysis
- scientific article; zbMATH DE number 4094599
- On principal subspace analysis
Cites work
- scientific article; zbMATH DE number 3936168 (Why is no real title available?)
- Methods of \(L_ 1\) estimation of a covariance matrix
- Principal component analysis based on robust estimators of the covariance or correlation matrix: influence functions and efficiencies
- Robust Q-mode principal component analysis in \(L_{1}\)
- Robust Singular Value Decompositions: A New Approach to Projection Pursuit
Cited in
(3)
This page was built for publication: On principal component analysis in \(L_{1}\).
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1614834)