atlas

Research map / Learning theory and algorithms / Clustering

Adaptive Clustering through Semidefinite Programming

NeurIPS 2017 · Learning theory and algorithms › Clustering · approach: Clustering approximation algorithms

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
Add the bias-correction term to the semidefinite clustering estimatorSemidefinite clustering · High-dimensional clusteringseparating rate: leading rate: γ²/m -> smaller than σ² √((K + log n)r*/m)Helped
Use the corrected estimator rather than the compared classical clustering methodsSimulated Gaussian clustering · Scenario S1split-join errorHelped
Use the corrected estimator rather than the compared classical clustering methodsSimulated Gaussian clustering · Scenario S2split-join errorHelped
Remove the bias-correction term (ablation)Semidefinite clustering · High-dimensional clusteringseparating rate: γ²/mHurt
Use the corrected estimator instead of K-meansSimulated Gaussian clustering · Scenario S2split-join errorMixed

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