The reviewed record of science sign in
Pith

arxiv: 1609.02997 · v2 · pith:FDQBAYW3 · submitted 2016-09-10 · stat.ML · cs.LG

Iteratively Reweighted Least Squares Algorithms for L1-Norm Principal Component Analysis

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:FDQBAYW3record.jsonopen to challenge →

classification stat.ML cs.LG
keywords algorithmsdatareweightedanalysiscomponenterroriterativelyleast
0
0 comments X
read the original abstract

Principal component analysis (PCA) is often used to reduce the dimension of data by selecting a few orthonormal vectors that explain most of the variance structure of the data. L1 PCA uses the L1 norm to measure error, whereas the conventional PCA uses the L2 norm. For the L1 PCA problem minimizing the fitting error of the reconstructed data, we propose an exact reweighted and an approximate algorithm based on iteratively reweighted least squares. We provide convergence analyses, and compare their performance against benchmark algorithms in the literature. The computational experiment shows that the proposed algorithms consistently perform best.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.