An Improved Branch-and-Bound Method for Maximum Monomial Agreement

DOI10.1287/IJOC.1110.0459zbMath1462.90104OpenAlexW2131062480MaRDI QIDQ2815448

Jonathan Eckstein, Noam Goldberg

Publication date: 29 June 2016

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1110.0459

zbMATH Keywords

combinatorial optimizationbranch and boundmachine learning

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27)

Related Items (3)

PEBBL: an object-oriented framework for scalable parallel branch and bound ⋮ A new column generation algorithm for logical analysis of data ⋮ Multilinear sets with two monomials and cardinality constraints

Uses Software

• UCI-ml
• AdaBoost.MH
• PEBBL

Cites Work

• Unnamed Item
• Unnamed Item
• Predictive learning via rule ensembles
• Chance constrained uncertain classification via robust optimization
• Maximizing agreements and coagnostic learning
• Toward efficient agnostic learning
• Logical analysis of numerical data
• A decision-theoretic generalization of on-line learning and an application to boosting
• Finding essential attributes from binary data
• The maximum box problem and its application to data analysis
• Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning
• Improved boosting algorithms using confidence-rated predictions
• Binarized Support Vector Machines
• Learning in the Presence of Malicious Errors
• 10.1162/153244304773936072
• Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
• Linear programming boosting via column generation

This page was built for publication: An Improved Branch-and-Bound Method for Maximum Monomial Agreement