An Improved Branch-and-Bound Method for Maximum Monomial Agreement (Q2815448)

From MaRDI portal
Revision as of 23:41, 19 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An Improved Branch-and-Bound Method for Maximum Monomial Agreement
scientific article

    Statements

    title
    An Improved Branch-and-Bound Method for Maximum Monomial Agreement (English)
    0 references
    author
    Jonathan Eckstein
    0 references
    Noam Goldberg
    0 references
    publication date
    29 June 2016
    0 references
    zbMATH Keywords
    branch and bound
    0 references
    combinatorial optimization
    0 references
    machine learning
    0 references
    describes a project that uses
    AdaBoost.MH
    0 references
    PEBBL
    0 references
    UCI-ml
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C27
    0 references
    90C57
    0 references
    68T05
    0 references
    zbMATH DE Number
    6599273
    0 references
    OpenAlex ID
    W2131062480
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2815448&oldid=39219956"
    Powered by MediaWiki