L1-norm projection pursuit principal component analysis
From MaRDI portal
Publication:959241
DOI10.1016/j.csda.2005.01.009zbMath1445.62130OpenAlexW1993670676MaRDI QIDQ959241
Publication date: 11 December 2008
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.csda.2005.01.009
dualityoutlier identificationmatrix normscontraction mappingcentroid decompositionascent algorithmBenzecri's measure of influence
Related Items
Graph partitioning by correspondence analysis and taxicab correspondence analysis ⋮ A pure \(L_1\)-norm principal component analysis ⋮ Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for \(\boldsymbol{\ell_1}\) -Norm Principal Component Analysis ⋮ Picture of all solutions of successive 2-block maxbet problems ⋮ Multiple taxicab correspondence analysis ⋮ Reconstructing distances among objects from their discriminability ⋮ Joint sparse principal component analysis ⋮ Robust centroid method ⋮ Nonparametric and robust methods. (Editorial) ⋮ Some new aspects of taxicab correspondence analysis
Cites Work
- Correspondence analysis with least absolute residuals
- Homogeneity analysis using absolute deviations
- Methods of \(L_ 1\) estimation of a covariance matrix
- Transposition invariant principal component analysis in \(L_{1}\) for long tailed data
- Principal component analysis.
- The optimality of the centroid method
- The Centroid Decomposition: Relationships between Discrete Variational Decompositions and SVDs
- Projection-Pursuit Approach to Robust Dispersion Matrices and Principal Components: Primary Theory and Monte Carlo
- Stability of principal component analysis studied by the bootstrap method
- Lower Rank Approximation of Matrices by Least Squares with Any Choice of Weights
- Fast Very Robust Methods for the Detection of Multiple Outliers
- Identification of Outliers in Multivariate Data
- An algorithm for nonmetric discriminant analysis.
- Robust Q-mode principal component analysis in \(L_{1}\)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item