Research map / Optimization / Optimizers
Detecting Overlapping and Correlated Communities without Pure Nodes: Identifiability and Algorithm
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use second-order 2-star graph moment (k-1 S1 nodes, S0 as samples) with CD-MVSI volume-minimization instead of pure-node assumption | MMSB community detection on co-authorship networks · MAG1, MAG2, DBLP-1..DBLP-5 | SRCavg | Helped |
| CD-MVSI replaces pure-node based GeoNMF/SPOC with the sufficiently scattered volume-minimization approach | community detection run time · MAG1, MAG2, DBLP-1..DBLP-5 | run time: at least 10 times faster than GeoNMF and SPOC | Helped |
| Replace tensor CPD third-order moment method (Dirichlet assumption, alpha0=k) with CD-MVSI | community detection on co-authorship networks · MAG1, MAG2, DBLP-1..DBLP-5 | SRCavg | Helped |
Closest papers by meaning
- Provable Overlapping Community Detection in Weighted Graphs (NeurIPS 2020 · similarity 0.92)
- On Mixed Memberships and Symmetric Nonnegative Matrix Factorizations (ICML 2017 · similarity 0.91)
- Recovering Unbalanced Communities in the Stochastic Block Model with Application to Clustering with a Faulty Oracle (NeurIPS 2023 · similarity 0.90)
- Harnessing Multiple Correlated Networks for Exact Community Recovery (NeurIPS 2024 · similarity 0.88)
- Efficient Graph Matching for Correlated Stochastic Block Models (NeurIPS 2024 · similarity 0.88)
- 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.