AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

Compressed K-Means for Large-Scale Clustering

Xiaobo Shen, Weiwei Liu, Ivor Tsang, Fumin Shen, Quan-Sen Sun

AAAI 2017 · Learning theory and algorithms › Clustering · approach: k-means++ seeding analysis · 74 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
jointly learn binary codes and clusters instead of LSH then bk-means two-stepCKM · RCV1, ILSVRC2012clustering accuracyImproved
replace LSH+bk-means with CKMbinary-code clustering · MINIST8Mrunning time (s): 101s -> 248sHurt
replace k-means with CKMk-means · MINIST8Mrunning time (s): 9718s -> 248sImproved
replace k-means with CKMk-means · ILSVRC2012memory usage: 43.62GB -> 21.30MBImproved
replace k-means with CKMk-means · four large-scale datasetsclustering accuracyNo clear effect
increase subset ratio beta used to learn binary function from 0.01 to 1 (ablation)CKM · four large-scale datasetsclustering accuracyNo clear effect

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