Research map / Learning theory and algorithms / Clustering
An iterative clustering algorithm for the Contextual Stochastic Block Model with optimality guarantees
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.
Closest papers by meaning
- Graph Clustering: Block-models and model free results (NeurIPS 2016 · similarity 0.91)
- Multi-View Stochastic Block Models (ICML 2024 · similarity 0.90)
- Revisiting Instance-Optimal Cluster Recovery in the Labeled Stochastic Block Model (ICML 2025 · similarity 0.89)
- Optimal Graph Clustering without Edge Density Signals (NeurIPS 2025 · similarity 0.89)
- Efficient Graph Matching for Correlated Stochastic Block Models (NeurIPS 2024 · similarity 0.89)
- A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering (ICML 2024 · similarity 0.89)
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.