Research map / Learning theory and algorithms / Clustering
Optimal Bipartite Network Clustering
Zhixin Zhou, Arash A. Amini
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 |
|---|---|---|---|
| initialize soft pseudo-likelihood iterations from spectral clustering | Spectral clustering · Synthetic bipartite SBM (alpha=.75, C=1) | NMI | Improved |
| use soft labels instead of hard labels between iterations | Pseudo-likelihood biclustering · Synthetic bipartite SBM (alpha=.75, C=1) | misclassification rate | Improved |
Closest papers by meaning
- Analysis of spectral clustering algorithms for community detection: the general bipartite setting (JMLR 2019 · similarity 0.93)
- Optimal community detection in dense bipartite graphs (NeurIPS 2025 · similarity 0.90)
- Matched Bipartite Block Model with Covariates (JMLR 2019 · similarity 0.90)
- Online Sparsification of Bipartite-Like Clusters in Graphs (ICML 2025 · similarity 0.90)
- Recovering Unbalanced Communities in the Stochastic Block Model with Application to Clustering with a Faulty Oracle (NeurIPS 2023 · similarity 0.89)
- Revisiting Instance-Optimal Cluster Recovery in the Labeled Stochastic Block Model (ICML 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.
