Speeding up algorithm selection using average ranking and active testing by introducing runtime (Q1707468)
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: Speeding up algorithm selection using average ranking and active testing by introducing runtime |
scientific article; zbMATH DE number 6855213
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Speeding up algorithm selection using average ranking and active testing by introducing runtime |
scientific article; zbMATH DE number 6855213 |
Statements
Speeding up algorithm selection using average ranking and active testing by introducing runtime (English)
0 references
3 April 2018
0 references
algorithm selection
0 references
meta-learning
0 references
ranking of algorithms
0 references
average ranking
0 references
active testing
0 references
loss curves
0 references
mean interval loss
0 references
