Research map / Learning theory and algorithms / Clustering
Clustering with Semidefinite Programming and Fixed Point Iteration
Pedro Felzenszwalb, Caroline Klivans, Alice Paul
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 |
|---|---|---|---|
| Round the Max k-Cut SDP solution with fixed point iteration instead of randomized rounding | Max k-Cut SDP clustering · Synthetic 8-Gaussian mixture (10 datasets, k=8) | Rand index: 0.935 ± 0.018 -> 0.972 ± 0.006 | Improved |
| Round with fixed point iteration instead of best of 50 randomized rounding trials | Max k-Cut SDP clustering · Synthetic 8-Gaussian mixture (10 datasets, k=8) | partition weight ratio: 1.005 to 1.026, mean 1.014 | Improved |
| Round with fixed point iteration instead of randomized rounding | Max k-Cut SDP clustering · MNIST digits 0-4 subset (20 trials) | Rand index: 0.874 ± 0.037 -> 0.907 ± 0.026 | Improved |
| Use Max k-Cut SDP with fixed point iteration instead of k-means | clustering · MNIST digits 0-4 subset (20 trials) | Rand index: 0.864 ± 0.034 -> 0.907 ± 0.026 | Improved |
| Increase number of clusters from 5 to 10 and 20 | randomized rounding · Synthetic 200 points (D-31 subset) | partition weight | Hurt |
Closest papers by meaning
- Exact Clustering of Weighted Graphs via Semidefinite Programming (JMLR 2019 · similarity 0.91)
- Adaptive Clustering through Semidefinite Programming (NeurIPS 2017 · similarity 0.90)
- Statistically Optimal $K$-means Clustering via Nonnegative Low-rank Semidefinite Programming (ICLR 2024 · similarity 0.89)
- New l1-Norm Relaxations and Optimizations for Graph Clustering (AAAI 2016 · similarity 0.89)
- A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering (ICML 2024 · similarity 0.88)
- Competitively Consistent Clustering (ICML 2025 · similarity 0.87)
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.
