atlas

Research map / Learning theory and algorithms / Clustering

On the price of explainability for some clustering problems

ICML 2021 · Learning theory and algorithms › Clustering · approach: k-means++ seeding analysis · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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 Ex-Greedy instead of IMMk-means explainable clustering · micecost ratio: 1,12 -> 1,08Helped
Use Ex-Greedy instead of IMMk-means explainable clustering · anurancost ratio: 1,30 -> 1,15Helped
Use Ex-Greedy instead of IMMk-means explainable clustering · CIFAR-10cost ratio: 1,23 -> 1,17Helped
Use Ex-Greedy instead of IMMk-means explainable clustering · digitscost ratio: 1,23 -> 1,24Hurt
Use Ex-Greedy instead of IMMk-means explainable clustering · breast_cancer, iris, wine, covtype, avila, newgroupcost ratio: 1,00 -> 1,00; 1,04 -> 1,04; 1,00 -> 1,00; 1,03 -> 1,03; 1,10 -> 1,10; 1,01 -> 1,01No clear effect
Constrain clustering to decision-tree-induced partitionsk-centers · k-centersprice of explainability: O\left( \sqrt{d}k^{1-1/d} \right)Hurt
Constrain clustering to decision-tree-induced partitionsmaximum-spacing clustering · maximum-spacingprice of explainability: \Theta(n-k)Hurt

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