Research map / Learning theory and algorithms / Clustering
Optimization of Inter-group criteria for clustering with minimum size constraints
Eduardo Sany Laber, Lucas Murtinho
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 |
|---|---|---|---|
| Use AlgoMinSp instead of k-means | clustering with minimum group-size constraints · 10 real datasets | minsp | Improved |
| Use Constrained-MaxMST instead of k-means | clustering with minimum group-size constraints · 10 real datasets | spmst | Improved |
| Use AlgoMinSp rather than Constrained-MaxMST | proposed clustering methods · 10 real datasets | minsp | Mixed |
| Use Constrained-MaxMST rather than AlgoMinSp | proposed clustering methods · 10 real datasets | spmst | Mixed |
| Restrict the candidate group counts to ceil(k / 2^t) values (ablation) | Constrained-MaxMST · 10 real datasets | spmst: less than 10% | Mixed |
| Restrict the candidate group counts to ceil(k / 2^t) values (ablation) | Constrained-MaxMST · 10 real datasets | running time: at least 30% | Improved |
| Allow smaller minimum clusters (ablation) | AlgoMinSp and Constrained-MaxMST · 5 smallest datasets | minsp and spmst | Improved |
| Randomize the splitting of groups when converting an ℓ-clustering to a k-clustering (ablation) | Constrained-MaxMST · 10 real datasets | spmst: 0.34; 0.002 | No clear effect |
Closest papers by meaning
- Hierarchical Clustering with Structural Constraints (ICML 2018 · similarity 0.88)
- New Bounds on the Cohesion of Complete-link and Other Linkage Methods for Agglomerative Clustering (ICML 2024 · similarity 0.88)
- Capacitated Fair-Range Clustering: Hardness and Approximation Algorithms (ICML 2026 · similarity 0.88)
- Approximately Pareto-optimal Solutions for Bi-Objective k-Clustering (NeurIPS 2024 · similarity 0.86)
- Efficient Constrained K-center Clustering with Background Knowledge (AAAI 2024 · similarity 0.86)
- Approximate Forest Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees (ICML 2025 · similarity 0.86)
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.
