An improved branch-and-bound method for maximum monomial agreement

DOI10.1287/IJOC.1110.0459MaRDI QIDQ2815448zbMATH OpenOpenAlexFDO

Authors 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

branch and boundcombinatorial optimizationmachine learning

Mathematics Subject Classification ID

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

Recommendations

• The maximum box problem and its application to data analysis
• On the sample monotonization problem
• On the difficulty of approximately maximizing agreements.
• Maximizing agreements with one-sided error with applications to heuristic learning
• Maximizing agreements with one-sided error with applications to heuristic learning

Cites work

• 10.1162/153244304773936072
• A decision-theoretic generalization of on-line learning and an application to boosting
• Binarized support vector machines
• Chance constrained uncertain classification via robust optimization
• Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning
• Finding essential attributes from binary data
• scientific article; zbMATH DE number 4164874 (Why is no real title available?)
• scientific article; zbMATH DE number 1947395 (Why is no real title available?)
• Improved boosting algorithms using confidence-rated predictions
• Learning in the Presence of Malicious Errors
• Linear programming boosting via column generation
• Logical analysis of numerical data
• Maximizing agreements and coagnostic learning
• Predictive learning via rule ensembles
• Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
• The maximum box problem and its application to data analysis
• Toward efficient agnostic learning

Cited in

(6)

• Multilinear sets with two monomials and cardinality constraints
• A branch-and-bound based method for solving monotone optimization problems
• A new column generation algorithm for logical analysis of data
• Rule generation for classification: scalability, interpretability, and fairness
• Convexifying multilinear sets with cardinality constraints: structural properties, nested case and extensions
• PEBBL: an object-oriented framework for scalable parallel branch and bound

Describes a project that uses

Uses Software

• UCI
• AdaBoost.MH
• PEBBL

This page was built for publication: An improved branch-and-bound method for maximum monomial agreement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815448)