An Improved Branch-and-Bound Method for Maximum Monomial Agreement (Q2815448): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1287/ijoc.1110.0459 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1287/ijoc.1110.0459 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2131062480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chance constrained uncertain classification via robust optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical analysis of numerical data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding essential attributes from binary data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing agreements and coagnostic learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binarized Support Vector Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming boosting via column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum box problem and its application to data analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decision-theoretic generalization of on-line learning and an application to boosting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predictive learning via rule ensembles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning in the Presence of Malicious Errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward efficient agnostic learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved boosting algorithms using confidence-rated predictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/153244304773936072 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1287/IJOC.1110.0459 / rank
 
Normal rank

Latest revision as of 23:41, 19 December 2024

scientific article
Language Label Description Also known as
English
An Improved Branch-and-Bound Method for Maximum Monomial Agreement
scientific article

    Statements

    An Improved Branch-and-Bound Method for Maximum Monomial Agreement (English)
    0 references
    0 references
    0 references
    29 June 2016
    0 references
    branch and bound
    0 references
    combinatorial optimization
    0 references
    machine learning
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references