Research map / Learning theory and algorithms / Clustering
Reduction Techniques for Graph-Based Convex Clustering
Lei Han, Yu Zhang
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 Eater rule before solving TCC | TCC with FISTA · Halfmoon (n=200) | running time (s): 134.4 -> 21.6 | Improved |
| Add Eater rule before solving TCC | TCC with FISTA · Spiral (n=200) | running time (s): 176.4 -> 31.3 | Improved |
| Add Cigar rule before solving CGCC-1 | CGCC with ADMM · Halfmoon (n=200) | running time (s): 189.3 -> 25.0 | Improved |
| Add Cigar rule before solving CGCC-2 | CGCC with ADMM · Halfmoon (n=200) | running time (s): 201.6 -> 42.9 | Improved |
| Add Cigar rule before solving CGCC-1 | CGCC with ADMM · Spiral (n=200) | running time (s): 202.2 -> 85.2 | Improved |
| Add Cigar rule before solving CGCC-2 | CGCC with ADMM · Spiral (n=200) | running time (s): 233.4 -> 88.2 | Improved |
| Add Eater rule before solving TCC | TCC · Iris | running time (s): 247.6 -> 28.5 | Improved |
| Add Eater rule before solving TCC | TCC · Vehicle | running time (s): 1399.5 -> 168.7 | Improved |
| Add Cigar rule before solving CGCC-1 | CGCC · Vehicle | running time (s): 2625.7 -> 877.5 | Improved |
| Add Cigar rule before solving CGCC-2 | CGCC · Vehicle | running time (s): 3473.7 -> 1271.4 | Improved |
| Add more edges to the graph (CGCC-2 vs CGCC-1) with Cigar rule (ablation) | Cigar rule · Halfmoon (n=200) | speedup: 7.6 -> 4.7 | Hurt |
| Add more edges to the graph (CGCC-2 vs CGCC-1) with Cigar rule (ablation) | Cigar rule · Spiral (n=200) | speedup: 2.4 -> 2.6 | No clear effect |
Closest papers by meaning
- Convex Clustering: Model, Theoretical Guarantee and Efficient Algorithm (JMLR 2021 · similarity 0.88)
- Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth (NeurIPS 2022 · similarity 0.87)
- An Efficient Semismooth Newton based Algorithm for Convex Clustering (ICML 2018 · similarity 0.87)
- Graph-based Clustering Revisited: A Relaxation of Kernel k-Means Perspective (JMLR 2026 · similarity 0.86)
- Clustering from General Pairwise Observations with Applications to Time-varying Graphs (JMLR 2017 · similarity 0.86)
- THESAURUS: Contrastive Graph Clustering by Swapping Fused Gromov-Wasserstein Couplings (AAAI 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.
