On a variant of the problem of choosing a vector subset (Q3115704)
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: On a variant of the problem of choosing a vector subset |
scientific article; zbMATH DE number 6004963
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a variant of the problem of choosing a vector subset |
scientific article; zbMATH DE number 6004963 |
Statements
10 February 2012
0 references
choice of a vector subset
0 references
algorithmic complexity
0 references
NP-completeness
0 references
cluster analysis
0 references
0.8835613131523132
0 references
0.873063325881958
0 references
0.8538906574249268
0 references
0.8317683339118958
0 references
0.8059553503990173
0 references
