Research map / Learning theory and algorithms / Clustering
Solving Soft Clustering Ensemble via $k$-Sparse Discrete Wasserstein Barycenter
Ruizhe Qin, Mengying Li, Hu Ding
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 the Wasserstein barycenter based algorithm (AM) instead of BGP and FURTHEST | soft clustering ensemble · USPS, CIFAR-10 | objective value, Wasserstein distance to ground truth, runtime | Improved |
| use the Wasserstein barycenter algorithm instead of baselines on the smallest dataset | soft clustering ensemble · IRIS | runtime | Hurt |
| increase the sampling rate r of AM-r (ablation) | AM-r · USPS, IRIS, CIFAR-10 convergence as m grows | Wasserstein distance to ground truth | Improved |
Closest papers by meaning
- Multilevel Clustering via Wasserstein Means (ICML 2017 · similarity 0.88)
- On efficient multilevel Clustering via Wasserstein distances (JMLR 2021 · similarity 0.88)
- Generalization Performance of Ensemble Clustering: From Theory to Algorithm (ICML 2025 · similarity 0.87)
- Relax and Merge: A Simple Yet Effective Framework for Solving Fair $k$-Means and $k$-sparse Wasserstein Barycenter Problems (ICLR 2025 · similarity 0.86)
- Finding Wasserstein Ball Center: Efficient Algorithm and The Applications in Fairness (ICML 2025 · similarity 0.86)
- Enhancing Ensemble Clustering with Adaptive High-Order Topological Weights (AAAI 2024 · 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.
