atlas

Research map / Learning theory and algorithms / Clustering

Selective Sampling-based Scalable Sparse Subspace Clustering

NeurIPS 2019 · Learning theory and algorithms › Clustering · approach: Subspace clustering · 38 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
replace random subsampling with subgradient-based selective sampling (ablation)S5C · Yale Bobjective value vs number of subsamples: ~75% of subsamples reach the same objective as S5C-randHelped
use orthogonal iteration instead of exact NCut eigendecomposition for spectral clustering (ablation)S5C · COIL-100clustering error (%): 47.0 -> 45.4 (time 290.0 -> 27.4 s)No clear effect
use orthogonal iteration (block of eigenvectors) instead of power iteration clustering (ablation)S5C spectral step · Yale Bclustering error (%): 83.9 -> 42.8Helped
use orthogonal iteration instead of PIC (ablation)S5C spectral step · COIL-100clustering error (%): 77.4 -> 45.4Helped
use orthogonal iteration instead of PIC (ablation)S5C spectral step · COIL-100time (s): 16.4 -> 27.4Hurt
S5C vs SSC-ORGEN across datasetsS5C · six real datasetsclustering error (%): Yale B 37.4 -> 39.3; COIL-100 89.7 -> 45.9; MNIST 28.7 -> 40.4Mixed

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