Efficient algorithms for computing the best subset regression models for large-scale problems (Q1020780)
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 5560137
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for computing the best subset regression models for large-scale problems |
scientific article; zbMATH DE number 5560137 |
Statements
Efficient algorithms for computing the best subset regression models for large-scale problems (English)
0 references
2 June 2009
0 references
best-subset regression
0 references
regression tree
0 references
branch-and-bound algorithm
0 references
0 references
0.7660322785377502
0 references
0.7548407912254333
0 references
0.7528707385063171
0 references
0.7499303817749023
0 references
