AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

Robust Spectral Clustering with Rank Statistics

Joshua Cape, Xianshi Yu, Jonquil Z. Liao

JMLR 2024 · Learning theory and algorithms › Clustering · approach: Subspace clustering · 2 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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
apply pass-to-ranks transform before spectral embeddingSpectral embedding · Pareto blockmodel (n=400, K=2)clustering qualityImproved
apply pass-to-ranks transform to Cauchy-contaminated dataSpectral embedding · Gaussian K=3 blockmodel (n=1800, 1% Cauchy contamination)embedding stabilityImproved
apply pass-to-ranks transform when raw block mean matrix is rank oneSpectral clustering · Gamma blockmodel K=2rank of block mean matrix: rank 1 -> rank 2Improved
apply pass-to-ranks transform to Exponential blockmodelSpectral clustering · Exponential blockmodel K=2eigenvectors separating blocksImproved
apply pass-to-ranks transform to contaminated normal dataSpectral clustering · Contaminated normal K=2 (n=500, 50 replicates)eigenvector error ratioMixed
apply pass-to-ranks transform with large original block variancesSpectral clustering · Gaussian K=2 asymptotic variance ratioasymptotic relative efficiencyMixed

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