atlas

Research map / Learning theory and algorithms / Clustering

Decentralized Robust Subspace Clustering

AAAI 2016 · Learning theory and algorithms › Clustering · approach: Subspace clustering · 13 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
solve SSC in column blocks on 2-6 cores instead of traditional SSCSSC · MNIST 5000 imagestime cost: reduce around 55% −85% time costHelped
column-block distributed ADMM vs SSCSSC · MNIST 5000 imagesclustering errorNo clear effect
column-block ADMM with outliersSSC · MNIST + 1000 outlierstime cost: 68% −90%Helped
column-block ADMM on semi-supervised graph constructionSSC · MNIST-15ktime cost: less than 6%Helped
column-block ADMM on semi-supervised graph constructionSSC · MNIST-15k and CIFAR10-10kclassification errorNo clear effect
column-block ADMM on CIFAR10-10kSSC · CIFAR10-10ktime cost: less than 17%Helped
warm start of inner Lasso solver (ablation)DSSC-ADMM · convergenceoptimization efficiencyHelped

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