The maximum box problem and its application to data analysis
From MaRDI portal
Publication:1856362
DOI10.1023/A:1020546910706zbMath1028.90039OpenAlexW1541384941MaRDI QIDQ1856362
Mikhail Nediak, Peter L. Hammer, Ying Liu, Bruno Simeone, Jonathan Eckstein
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
Logical analysis of data -- the vision of Peter L. Hammer, Logical analysis of data -- an overview: from combinatorial optimization to medical applications, Integrated optimization model and algorithm for pattern generation and selection in logical analysis of data, Pruning boxes in a box-based classification method, Supervised box clustering, Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension, Monochromatic partitioning of colored points by lines, Variations of largest rectangle recognition amidst a bichromatic point set, Computing optimal islands, Polynomial Time Algorithms for Bichromatic Problems, Logical analysis of data: classification with justification, Maximum-weight planar boxes in \(O(n^2)\) time (and better), Classifying negative and positive points by optimal box clustering, A greedy clustering algorithm based on interval pattern concepts and the problem of optimal box positioning, Norm ball classifier for one-class classification, Multi-pattern generation framework for logical analysis of data, Planar maximum-box problem revisited, Computing the coarseness with strips or boxes, Spanned patterns for the logical analysis of data, Extended box clustering for classification problems, An Improved Branch-and-Bound Method for Maximum Monomial Agreement, A combinatorial branch-and-bound algorithm for box search, Carpal tunnel syndrome automatic classification: electromyography vs. ultrasound imaging
