AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

Solving Soft Clustering Ensemble via $k$-Sparse Discrete Wasserstein Barycenter

Ruizhe Qin, Mengying Li, Hu Ding

NeurIPS 2021 · Learning theory and algorithms › Clustering · approach: Clustering approximation algorithms · 1 citations (OpenAlex)

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 changedWhereMeasuredEffect
use the Wasserstein barycenter based algorithm (AM) instead of BGP and FURTHESTsoft clustering ensemble · USPS, CIFAR-10objective value, Wasserstein distance to ground truth, runtimeImproved
use the Wasserstein barycenter algorithm instead of baselines on the smallest datasetsoft clustering ensemble · IRISruntimeHurt
increase the sampling rate r of AM-r (ablation)AM-r · USPS, IRIS, CIFAR-10 convergence as m growsWasserstein distance to ground truthImproved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy