A branch and bound method solving the max–min linear discriminant analysis problem (Q6078428)
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: A branch and bound method solving the max–min linear discriminant analysis problem |
scientific article; zbMATH DE number 7742848
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and bound method solving the max–min linear discriminant analysis problem |
scientific article; zbMATH DE number 7742848 |
Statements
A branch and bound method solving the max–min linear discriminant analysis problem (English)
0 references
27 September 2023
0 references
Fisher linear discriminant analysis
0 references
nonconvex optimization problem
0 references
0 references
0.8086739182472229
0 references
0.7478732466697693
0 references
0.7459047436714172
0 references
0.7456382513046265
0 references
