Research map / Learning theory and algorithms / Clustering
Solving the 2-norm k-hyperplane clustering problem via multi-norm formulations
Stefano Coniglio
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| add 1-norm-derived constraint ||w||_inf >= 1/sqrt(n) to the 2-norm formulation (ablation) | k-HC(2,1) · LowDim | median solve time (s): 169.9 -> 4.15 | Improved |
| add inf-norm constraint ||w||_inf >= 1 (ablation) | k-HC(2,1) · LowDim | median solve time (s): 169.9 -> 6.10 | Improved |
| add both polyhedral-norm constraints (multi) (ablation) | k-HC(2,1) · LowDim | median solve time (s): 169.9 -> 5.00 | Improved |
| add 1-norm-derived constraint ||w||_inf >= 1/sqrt(n) (ablation) | k-HC(2,1) · HighDim | median solve time (s): 208.6 -> 18.20 | Improved |
| add inf-norm constraint ||w||_inf >= 1 (ablation) | k-HC(2,1) · HighDim | median solve time (s): 208.6 -> 20.65 | Improved |
| add both polyhedral-norm constraints (multi) (ablation) | k-HC(2,1) · HighDim | median solve time (s): 208.6 -> 37.35 | Improved |
| add 1-norm-derived constraint (ablation) | k-HC(2,1) · HighDim | average SBB nodes: 7,987,723.07 -> 3,201,881.49 | Improved |
| add inf-norm constraint (ablation) | k-HC(2,1) · HighDim | average SBB nodes: 7,987,723.07 -> 2,741,496.67 | Improved |
| add strengthened formulations (ablation) | k-HC(2,1) · LowDim | instances solved: 21 more instances solved in under 2 hours | Improved |
| add strengthened formulation (best) (ablation) | k-HC(2,1) · HighDim | instances solved: 10 more instances solved | Improved |
Closest papers by meaning
- Improved Fixed-Parameter Bounds for Min-Sum-Radii and Diameters k-Clustering and Their Fair Variants (AAAI 2025 · similarity 0.88)
- Parameterized Approximation Algorithms for K-center Clustering and Variants (AAAI 2022 · similarity 0.88)
- Global Optimization of K-Center Clustering (ICML 2022 · similarity 0.87)
- Near-Optimal Private and Scalable $k$-Clustering (NeurIPS 2022 · similarity 0.87)
- Efficient Constrained K-center Clustering with Background Knowledge (AAAI 2024 · similarity 0.86)
- Competitively Consistent Clustering (ICML 2025 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
