The maximum box problem and its application to data analysis

DOI10.1023/A:1020546910706MaRDI QIDQ1856362zbMATH OpenOpenAlexFDO

Authors Jonathan Eckstein, Peter L. Hammer, Ying Liu, Mikhail Nediak, Bruno Simeone, Ying Liu

Publication date 19 January 2004

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1020546910706

zbMATH Keywords

branch and bounddata analysisdiscrete optimizationpatterns

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Planar maximum box problem
• Classifying negative and positive points by optimal box clustering
• A combinatorial branch-and-bound algorithm for box search
• Planar maximum-box problem revisited
• Maximum-weight planar boxes in \(O(n^2)\) time (and better)

Cited in

(28)

• Planar maximum-box problem revisited
• Planar maximum box problem
• Variations of largest rectangle recognition amidst a bichromatic point set
• Norm ball classifier for one-class classification
• A combinatorial branch-and-bound algorithm for box search
• Carpal tunnel syndrome automatic classification: electromyography vs. ultrasound imaging
• Logical analysis of data -- the vision of Peter L. Hammer
• Pruning boxes in a box-based classification method
• Supervised box clustering
• Maximum-weight planar boxes in \(O(n^2)\) time (and better)
• Classifying negative and positive points by optimal box clustering
• Spanned patterns for the logical analysis of data
• Integrated optimization model and algorithm for pattern generation and selection in logical analysis of data
• An improved branch-and-bound method for maximum monomial agreement
• Polynomial time algorithms for bichromatic problems
• Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension
• Computing optimal islands
• Maximum volume subset selection for anchored boxes
• Multi-pattern generation framework for logical analysis of data
• Computing the coarseness with strips or boxes
• Maximum box problem on stochastic points
• Monochromatic partitioning of colored points by lines
• The max-out min-in problem: a tool for data analysis
• Logical analysis of data: classification with justification
• A greedy clustering algorithm based on interval pattern concepts and the problem of optimal box positioning
• Extended box clustering for classification problems
• Incompatibility graphs in data mining
• Logical analysis of data -- an overview: from combinatorial optimization to medical applications

This page was built for publication: The maximum box problem and its application to data analysis

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