Research map / Learning theory and algorithms / Clustering
Higher-Order Spectral Clustering Under Superimposed Stochastic Block Models
Subhadeep Paul, Olgica Milenkovic, Yuguo Chen
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 |
|---|---|---|---|
| use SupSBM instead of SBM for triangle prediction | low-rank network CV · Political blogs | CV MSE triangle: 129.8989 -> 14.6117 | Improved |
| use SupSBM instead of SBM for triangle prediction | low-rank network CV · C. Elegans | CV MSE triangle: 46.8680 -> 1.8014 | Improved |
| use SupSBM instead of SBM for triangle prediction | low-rank network CV · Dolphin | CV MSE triangle: 1.8591 -> 0.4642 | Improved |
| use SupSBM instead of SBM for triangle prediction | low-rank network CV · Karate club | CV MSE triangle: 0.9463 -> 0.7377 | Improved |
| use SupSBM instead of SBM for edge prediction | low-rank network CV · Karate club | CV MSE edge: 0.1400 -> 0.1545 | Hurt |
| use SupSBM instead of SBM for edge prediction | low-rank network CV · Political blogs | CV MSE edge: 0.0690 -> 0.0773 | Hurt |
| use triangle-based hospL instead of edge-based spL | normalized Laplacian spectral clustering · Political blogs | misclustered vertices: 588 -> 59 | Improved |
| use triangle-based hospA instead of edge-based spA | adjacency spectral clustering · Political blogs | misclustered vertices: 63 -> 71 | No clear effect |
| use triangle-based horspL instead of edge-based rspL | regularized Laplacian spectral clustering · Dolphin | misclustered vertices: 2 -> 1 | Improved |
| use triangle-based horspL instead of rspL | regularized Laplacian spectral clustering · Political blogs | misclustered vertices: 64 -> 64 | No clear effect |
Closest papers by meaning
- Analysis of spectral clustering algorithms for community detection: the general bipartite setting (JMLR 2019 · similarity 0.92)
- Strong Consistency, Graph Laplacians, and the Stochastic Block Model (JMLR 2021 · similarity 0.91)
- On the Robustness of Spectral Algorithms for Semirandom Stochastic Block Models (NeurIPS 2024 · similarity 0.89)
- Optimal Graph Clustering without Edge Density Signals (NeurIPS 2025 · similarity 0.89)
- Revisiting Instance-Optimal Cluster Recovery in the Labeled Stochastic Block Model (ICML 2025 · similarity 0.88)
- Exact Community Recovery under Side Information: Optimality of Spectral Algorithms (ICLR 2025 · similarity 0.88)
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.
