Research map / Learning theory and algorithms / Clustering
Exact Clustering via Integer Programming and Maximum Satisfiability
Atsushi Miyauchi, Tomohiro Sonobe, Noriyoshi Sukegawa
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 |
|---|---|---|---|
| perturb zero-weight edges to -eps (RP(G~)) instead of RP(G) | ILP formulation · P1 Protein1 | #constraints: 148,995,305 -> 12,106,852 | Improved |
| use Miyauchi-Sukegawa reduction RP(G) instead of P(G) | ILP formulation · P1 Protein1 | #constraints: 149,038,482 -> 148,995,305 | No clear effect |
| use perturbed ILP instead of P(G) | ILP clustering · C2 Divorces | time (s): 4,927.8 -> 64.8 | Improved |
| use unperturbed RP*(G)+pp instead of perturbed RP(G~) eps=1/n^2 (ablation) | ILP clustering · G26 CH6-24x40 | time (s): 62.2 -> 25.5 | Improved |
| use RP*(G)+pp instead of P(G) | ILP clustering · G32 St-30x50-2 | time (s): 2,634.1 -> 47.0 | Improved |
| use RP(G~) instead of MaxSAT-Binary | ILP clustering · C5 Graph product | time (s): 4,994.9 -> 15.9 | Improved |
| use RP(G~) instead of MaxSAT-Binary | ILP clustering · P1 Protein1 | time (s): 2,304.8 -> 4,010.3 | Hurt |
| choose eps=2/n^2 instead of 1/n^2 (ablation) | ILP clustering · G18 MT-20x20 | time (s): 433.6 -> 343.6 | Improved |
| choose eps=2/n^2 instead of 1/n^2 (ablation) | ILP clustering · G34 MC-37x53 | time (s): 5,968.0 -> 7344.6 | Hurt |
| use RP(G) instead of P(G) | ILP formulation · group technology instances | time (s) | Mixed |
| use MaxSAT counterpart S-RP*(G)+S-pp instead of S-P(G) | MaxSAT clustering · P2 Protein2 | time (s): 2,690.6 -> 486.0 | Improved |
Closest papers by meaning
- Clustering with Semidefinite Programming and Fixed Point Iteration (JMLR 2022 · similarity 0.88)
- A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem (AAAI 2024 · similarity 0.86)
- Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach (NeurIPS 2025 · similarity 0.85)
- Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges (ICML 2025 · similarity 0.85)
- Upper Bounding Barlow Twins: A Novel Filter for Multi-Relational Clustering (AAAI 2024 · similarity 0.85)
- Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better (ICML 2024 · similarity 0.84)
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.
