atlas

Research map / Learning theory and algorithms / Clustering

On Robustness of Kernel Clustering

NeurIPS 2016 · Learning theory and algorithms › Clustering · approach: Subspace clustering · 17 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 SDP relaxation (SDP-1) instead of K-SVD for kernel clusteringkernel k-means clustering · synthetic Gaussian mixture with outliersinlier accuracy vs number of outliersHelped
Use SDP relaxation instead of K-SVD as number of clusters grows with outliers presentkernel k-means clustering · synthetic, n=p=1500, m=10inlier accuracyHelped
Use SDP relaxation instead of K-SVD under varying minimum cluster separationkernel k-means clustering · synthetic, n=1000, r=5, m=50variance of inlier accuracy across runsHelped

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