Research map / Graph learning / Graph algorithms and clustering
Variational Estimators of the Degree-corrected Latent Block Model for Bipartite Networks
Yunpeng Zhao, Ning Hao, Ji Zhu
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 |
|---|---|---|---|
| add degree parameters (DC-LBM instead of PL biclustering) | biclustering of MovieLens user-movie matrix · MovieLens (single-category movies) | chi-squared p-value of cluster vs category association: 0.0415 -> 2.66 \times 10^{-7} | Improved |
| fit DC-LBM when true model has equal degrees (classical LBM) | DC-LBM variational EM · Poisson simulation, m=800, n=1000 | adjusted Rand index | No clear effect |
| misspecify Bernoulli data with Poisson likelihood | DC-LBM variational EM · Bernoulli simulation | adjusted Rand index | No clear effect |
Closest papers by meaning
- Matched Bipartite Block Model with Covariates (JMLR 2019 · similarity 0.89)
- Learning Bipartite Graphs: Heavy Tails and Multiple Components (NeurIPS 2022 · similarity 0.88)
- Network two-sample test for block models (NeurIPS 2025 · similarity 0.87)
- From Your Block to Our Block: How to Find Shared Structure Between Stochastic Block Models over Multiple Graphs (AAAI 2025 · similarity 0.86)
- Efficient Graph Matching for Correlated Stochastic Block Models (NeurIPS 2024 · similarity 0.85)
- Optimal Graph Clustering without Edge Density Signals (NeurIPS 2025 · similarity 0.85)
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.
