On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms (Q1959594)

From MaRDI portal
Revision as of 06:49, 3 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    7 October 2010
    0 references
    boosting
    0 references
    margin
    0 references
    linear separability
    0 references
    minimax theorem
    0 references

    Identifiers