On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms (Q1959594): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10994-010-5173-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2069936846 / rank | |||
Normal rank | |||
Revision as of 02:47, 20 March 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
