Optimal Algorithms for Binary, Sparse, and L 1-Norm Principal Component Analysis (Q4983084)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal Algorithms for Binary, Sparse, and L 1-Norm Principal Component Analysis |
scientific article; zbMATH DE number 6424770
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal Algorithms for Binary, Sparse, and L 1-Norm Principal Component Analysis |
scientific article; zbMATH DE number 6424770 |
Statements
Optimal Algorithms for Binary, Sparse, and L 1-Norm Principal Component Analysis (English)
0 references
14 April 2015
0 references
0-1 variables
0 references
algorithms
0 references
binary sequences
0 references
code-division multiplexing
0 references
combinatorial optimization
0 references
complexity
0 references
dimensionality reduction
0 references
eigenvalues and eigenfunctions
0 references
feature extraction
0 references
information processing
0 references
\(L_1\) norm
0 references
\(L_2\) norm
0 references
machine learning
0 references
maximization of quadratic forms
0 references
maximum-likelihood detection
0 references
MIMO systems
0 references
noncoherent communication
0 references
outlier resistance
0 references
polynomial algorithms
0 references
principal component analysis
0 references
quadratic programming
0 references
subspace signal processing
0 references
