AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

Query K-means Clustering and the Double Dixie Cup Problem

I Chien, Chao Pan, Olgica Milenkovic

NeurIPS 2018 · Learning theory and algorithms › Clustering · approach: k-means++ seeding analysis · 2 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 Algorithm 1 instead of Algorithm 2Query-based K-means clustering · MNISTactual query complexity: 3,628,193,647 -> 12,195Improved
Use Algorithm 1 instead of Algorithm 2Query-based K-means clustering · CIFAR-10actual query complexity: 128,458,964 -> 12,490Improved
Use Algorithm 1 instead of Ailon et al. Algorithm 2Noiseless query-based K-means clustering · Synthetic, one cluster of size one, K=5query complexity: 6.55 \times 10^{11} -> 510,932Improved
Use Algorithm 1 instead of Ailon et al. Algorithm 2Noiseless query-based K-means clustering · Synthetic, one cluster of size one, K=10query complexity: 5.24 \times 10^{12} -> 4.16 \times 10^6Improved

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