Pages that link to "Item:Q1856362"
From MaRDI portal
The following pages link to The maximum box problem and its application to data analysis (Q1856362):
Displaying 26 items.
- Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension (Q413466) (← links)
- Computing optimal islands (Q433119) (← links)
- Multi-pattern generation framework for logical analysis of data (Q513641) (← links)
- Computing the coarseness with strips or boxes (Q526818) (← links)
- Logical analysis of data: classification with justification (Q646700) (← links)
- A greedy clustering algorithm based on interval pattern concepts and the problem of optimal box positioning (Q670431) (← links)
- Extended box clustering for classification problems (Q724605) (← links)
- Logical analysis of data -- an overview: from combinatorial optimization to medical applications (Q863611) (← links)
- Planar maximum-box problem revisited (Q1749536) (← links)
- Planar maximum box problem (Q1876598) (← links)
- Variations of largest rectangle recognition amidst a bichromatic point set (Q2201768) (← links)
- Norm ball classifier for one-class classification (Q2241193) (← links)
- A combinatorial branch-and-bound algorithm for box search (Q2339825) (← links)
- Carpal tunnel syndrome automatic classification: electromyography vs. ultrasound imaging (Q2343069) (← links)
- Logical analysis of data -- the vision of Peter L. Hammer (Q2385443) (← links)
- Pruning boxes in a box-based classification method (Q2418270) (← links)
- Supervised box clustering (Q2418297) (← links)
- Maximum-weight planar boxes in \(O(n^2)\) time (and better) (Q2448119) (← links)
- Classifying negative and positive points by optimal box clustering (Q2448911) (← links)
- Spanned patterns for the logical analysis of data (Q2489650) (← links)
- Integrated optimization model and algorithm for pattern generation and selection in logical analysis of data (Q2664403) (← links)
- An improved branch-and-bound method for maximum monomial agreement (Q2815448) (← links)
- Polynomial Time Algorithms for Bichromatic Problems (Q2971630) (← links)
- Maximum volume subset selection for anchored boxes (Q4580096) (← links)
- Maximum box problem on stochastic points (Q5918465) (← links)
- Monochromatic partitioning of colored points by lines (Q6161462) (← links)
