Research map / Graph learning / Graph algorithms and clustering
Learning Bipartite Graphs: Heavy Tails and Multiple Components
José Vinícius De Miranda Cardoso, Jiaxi Ying, Daniel P. Palomar
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 Student-t likelihood (SBG) instead of Gaussian SOBG/SGA for connected bipartite graphs | SBG · S&P500 rolling window | accuracy and modularity | Improved |
| use Student-t k-component bipartite graph learning (kSBG) vs SOBG and SGLA | kSBG · S&P500 rolling window, k=8 | accuracy and modularity: 0.75 -> 0.97 accuracy | Improved |
| kSBG vs SGLA on full dataset | kSBG · S&P500 whole dataset | accuracy: 0.77 -> 0.97 | Improved |
| kSBG vs SOBG on full dataset | kSBG · S&P500 whole dataset | modularity: 0.61 -> 0.82 | Improved |
| kSBG vs SGLA on full dataset | kSBG · S&P500 whole dataset | modularity: 0.56 -> 0.82 | Improved |
| COVID-19 market turmoil from Jan 2020 | GBG, SBG, kSBG · S&P500 rolling window | accuracy and modularity | Hurt |
| uniform random vs default initialization (ablation) | SBG and kSBG · S&P500 (362 stocks, 9 sectors) 100 realizations | objective convergence and learned graph | No clear effect |
Closest papers by meaning
- Semiparametric Nonlinear Bipartite Graph Representation Learning with Provable Guarantees (ICML 2020 · similarity 0.88)
- Variational Estimators of the Degree-corrected Latent Block Model for Bipartite Networks (JMLR 2024 · similarity 0.88)
- A Unified Framework for Structured Graph Learning via Spectral Constraints (JMLR 2020 · similarity 0.88)
- Generalized Probabilistic Graphical Modeling for Multi-View Bipartite Graph Clustering (TPAMI 2025 · similarity 0.87)
- Graph Structure Inference with BAM: Neural Dependency Processing via Bilinear Attention (NeurIPS 2024 · similarity 0.85)
- Optimal community detection in dense bipartite graphs (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.
