Computing minimum-volume enclosing ellipsoids for large datasets (Q2129596)
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 7512638
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing minimum-volume enclosing ellipsoids for large datasets |
scientific article; zbMATH DE number 7512638 |
Statements
Computing minimum-volume enclosing ellipsoids for large datasets (English)
0 references
22 April 2022
0 references
minimum-volume enclosing ellipsoid
0 references
\(D\)-optimal design
0 references
algorithm
0 references
tall data
0 references
0 references
0 references
0 references
0 references
0.8456832766532898
0 references
0.7987180948257446
0 references
0.7940633296966553
0 references
0.7918069958686829
0 references
0.7839868664741516
0 references
