NP-hardness and inapproximability of sparse PCA (Q2361497)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-hardness and inapproximability of sparse PCA |
scientific article |
Statements
NP-hardness and inapproximability of sparse PCA (English)
0 references
30 June 2017
0 references
combinatorial problems
0 references
variable selection
0 references
NP-hard/inapproximable
0 references
sparsity constraint
0 references
unsupervised learning
0 references
