Research map / Graph learning / Graph algorithms and clustering
Two-way Node Popularity Model for Directed and Bipartite Networks
Bing-Yi Jing, Ting Li, Jiangzhou Wang, Ya Wang
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 TSDC instead of DOM for fitting | TNPM · Normal case sigma=0.1, (n,m)=(1320,1320) | running time (s): 1482.88 -> 0.57 | Improved |
| use TSDC instead of DOM for fitting | TNPM · Normal case sigma=0.1, (n,m)=(360,360) | running time (s): 45.44 -> 0.07 | Improved |
| raise noise sigma from 0.1 to 0.5 (ablation) | DOM · (n,m)=(600,600) | running time (s): 173.12 -> 249.91 | Hurt |
| raise noise sigma from 0.1 to 0.5 (ablation) | TSDC · (n,m)=(360,360) | running time (s): 0.07 -> 0.27 | Hurt |
| use TSDC instead of OMPSC | TNPM · Normal case sigma=0.1, (n,m)=(1320,1320) | running time (s): 14.34 -> 0.57 | Improved |
| use TSDC instead of SVDK | TNPM · Normal case sigma=0.1, (n,m)=(1320,1320) | running time (s): 0.19 -> 0.57 | Hurt |
| use DOM and TSDC instead of OMPSC, COSSC, INSC, SVDK | TNPM · Normal, mixture and sparse simulations | NMI | Improved |
| increase sparsity (eta) of the network (ablation) | DOM and TSDC · Sparse case | NMI | Hurt |
| use DOM instead of TSDC on small, less sparse networks | TNPM · Sparse case | NMI | Improved |
| use TSDC clusters instead of a prior method on MovieLens | TNPM · MovieLens 100K | chi-squared p-value: 0.0415 -> 3.003 x 10^-11 | Improved |
Closest papers by meaning
- Community models for networks observed through edge nominations (JMLR 2023 · similarity 0.88)
- Optimal Bipartite Network Clustering (JMLR 2020 · similarity 0.88)
- Latent Space Inference of Internet-Scale Networks (JMLR 2016 · similarity 0.87)
- Analysis of spectral clustering algorithms for community detection: the general bipartite setting (JMLR 2019 · similarity 0.86)
- Optimal community detection in dense bipartite graphs (NeurIPS 2025 · similarity 0.86)
- Harnessing Multiple Correlated Networks for Exact Community Recovery (NeurIPS 2024 · 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.
