On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms (Q1959594): Difference between revisions
From MaRDI portal
Latest revision as of 06:49, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms |
scientific article |
Statements
On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms (English)
0 references
7 October 2010
0 references
boosting
0 references
margin
0 references
linear separability
0 references
minimax theorem
0 references