Generalization performance of bipartite ranking algorithms with convex losses (Q488690)

From MaRDI portal
Revision as of 13:19, 9 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
Generalization performance of bipartite ranking algorithms with convex losses
scientific article

    Statements

    Generalization performance of bipartite ranking algorithms with convex losses (English)
    0 references
    0 references
    0 references
    26 January 2015
    0 references
    bipartite ranking
    0 references
    generalization bound
    0 references
    Rademacher complexity
    0 references
    reproducing kernel Hilbert space
    0 references

    Identifiers