Research map / Graph learning / Graph algorithms and clustering
Mining Heavy Temporal Subgraphs: Fast Algorithms and Applications
Jose Cadena, Anil Vullikanti
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 C-SAR instead of NetSpot | C-SAR · Traffic | largest region size: 50% larger | Improved |
| use C-SAR instead of NetSpot | C-SAR · Traffic | average region score: 1,303.57 -> 1,577.87 | Improved |
| use C-SAR instead of NetSpot | C-SAR · Hospital | average region score: 137.90 -> 189.14 | Improved |
| use C-SAR instead of NetSpot | C-SAR · Twitter | average region score: 323.77 -> 315.53 | Hurt |
| use C-SAR instead of NetSpot | C-SAR · Wikipedia | average region score: 29.714 -> 27.33 | Hurt |
| use C-SAR instead of NetSpot | C-SAR · Traffic | number of regions: 7 -> 31 | Improved |
| use C-SAR instead of NetSpot | C-SAR · Twitter | number of regions: 56 -> 72 | Improved |
| use FASTGW-HDS instead of Basic | FASTGW-HDS · Hospital | running time | Improved |
| use FASTGW-HDS instead of Basic | FASTGW-HDS · Wikipedia | running time | Improved |
| use FASTGW-HDS instead of MEDEN | FASTGW-HDS · Twitter | objective score | No clear effect |
| use FASTGW-HDS instead of MEDEN | FASTGW-HDS · Traffic | objective score | Improved |
| use FASTGW-HDS instead of MEDEN with few positive edges | FASTGW-HDS · semi-synthetic Hospital/Twitter/Wikipedia | relative score | Improved |
Closest papers by meaning
- Graph Anomaly Detection as Dynamical Transport: Training-Free Scoring via Empirical Bayes (NeurIPS 2026 · similarity 0.85)
- Optimal Quasi-clique: Hardness, Equivalence with Densest-k-Subgraph, and Quasi-partitioned Community Mining (AAAI 2024 · similarity 0.84)
- New Parallel and Streaming Algorithms for Directed Densest Subgraph (NeurIPS 2025 · similarity 0.84)
- Faster Streaming and Scalable Algorithms for Finding Directed Dense Subgraphs in Large Graphs (ICML 2024 · similarity 0.84)
- A Generalizable Anomaly Detection Method in Dynamic Graphs (AAAI 2025 · similarity 0.84)
- UniGAD: Unifying Multi-level Graph Anomaly Detection (NeurIPS 2024 · similarity 0.84)
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.
