Mathematics Without Boundaries by Panos M. Pardalos & Themistocles M. Rassias

Author:Panos M. Pardalos & Themistocles M. Rassias
Language: eng
Format: epub
Publisher: Springer New York, New York, NY

Optimal Algorithms for Binary, Sparse, and L 1-Norm Principal Component Analysis

George N. Karystinos1

(1)Department of Electronic and Computer Engineering, Technical University of Crete, Chania, 73100, Greece

George N. Karystinos

Email: [email protected]

Abstract

The principal components of a data matrix based on the L 2 norm can be computed with polynomial complexity via the singular-value decomposition (SVD). If, however, the principal components are constrained to be finite-alphabet or sparse or the L 1 norm is used as an alternative of the L 2 norm, then the computation of them is NP-hard. In this work, we show that in all these problems, the optimal solution can be obtained in polynomial time if the rank of the data matrix is constant. Based on the auxiliary-unit-vector technique that we have developed over the past years, we present optimal algorithms and show that they are fully parallelizable and memory efficient, hence readily implementable. We analyze the properties of our algorithms, compare against the state of the art, and comment on communications and signal processing problems where they are directly applicable to. The efficiency of our auxiliary-unit-vector technique allows the development of a binary, sparse, or L 1 principal component analysis (PCA) line of research in parallel to the conventional L 2 PCA theory.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.