Research map / Learning theory and algorithms / Clustering
Robust Spectral Clustering with Rank Statistics
Joshua Cape, Xianshi Yu, Jonquil Z. Liao
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 changed | Where | Measured | Effect |
|---|---|---|---|
| apply pass-to-ranks transform before spectral embedding | Spectral embedding · Pareto blockmodel (n=400, K=2) | clustering quality | Improved |
| apply pass-to-ranks transform to Cauchy-contaminated data | Spectral embedding · Gaussian K=3 blockmodel (n=1800, 1% Cauchy contamination) | embedding stability | Improved |
| apply pass-to-ranks transform when raw block mean matrix is rank one | Spectral clustering · Gamma blockmodel K=2 | rank of block mean matrix: rank 1 -> rank 2 | Improved |
| apply pass-to-ranks transform to Exponential blockmodel | Spectral clustering · Exponential blockmodel K=2 | eigenvectors separating blocks | Improved |
| apply pass-to-ranks transform to contaminated normal data | Spectral clustering · Contaminated normal K=2 (n=500, 50 replicates) | eigenvector error ratio | Mixed |
| apply pass-to-ranks transform with large original block variances | Spectral clustering · Gaussian K=2 asymptotic variance ratio | asymptotic relative efficiency | Mixed |
Closest papers by meaning
- Analysis of spectral clustering algorithms for community detection: the general bipartite setting (JMLR 2019 · similarity 0.91)
- Subspace Structure-Aware Spectral Clustering for Robust Subspace Clustering (ICCV 2019 · similarity 0.90)
- Optimal Graph Clustering without Edge Density Signals (NeurIPS 2025 · similarity 0.89)
- Structure-Aware Spectral Sparsification via Uniform Edge Sampling (NeurIPS 2025 · similarity 0.89)
- On the Robustness of Spectral Algorithms for Semirandom Stochastic Block Models (NeurIPS 2024 · similarity 0.88)
- Pass-Efficient Algorithms for Graph Spectral Clustering (Student Abstract) (AAAI 2024 · similarity 0.87)
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.
