NP-hardness and inapproximability of sparse PCA (Q2361497)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6737727
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NP-hardness and inapproximability of sparse PCA |
scientific article; zbMATH DE number 6737727 |
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
0.8360787034034729
0 references
0.7815181612968445
0 references
0.7761464715003967
0 references
0.7710488438606262
0 references
0.750230610370636
0 references
