Efficient L1-Norm Principal-Component Analysis via Bit Flipping

DOI10.1109/TSP.2017.2708023zbMath1414.94401arXiv1610.01959OpenAlexW2529352582WikidataQ56686575 ScholiaQ56686575MaRDI QIDQ4621804

Shubham Chamadia, Sandipan Kundu, Dimitris A. Pados, Panos P. Markopoulos

Publication date: 8 February 2019

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.01959

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (6)

On the minimax spherical designs ⋮ Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for \(\boldsymbol{\ell_1}\) -Norm Principal Component Analysis ⋮ Dimension reduction big data using recognition of data features based on copula function and principal component analysis ⋮ On the robust PCA and Weiszfeld's algorithm ⋮ Optimization for L₁-Norm Error Fitting via Data Aggregation ⋮ ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching

This page was built for publication: Efficient L1-Norm Principal-Component Analysis via Bit Flipping