Research map / Graph learning / Graph self-supervised learning
Efficient Nonparametric Subgraph Detection Using Tree Shaped Priors
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 Steiner tree prior instead of BFS tree (ablation) | TSPSD (BJ) · BWSN water pollution, 10% noise | F-measure: 0.62 -> 0.91 | Helped |
| use Steiner tree prior instead of random spanning tree (ablation) | TSPSD (BJ) · BWSN water pollution, 10% noise | F-measure: 0.71 -> 0.91 | Helped |
| use Steiner tree prior instead of geodesic SPT (ablation) | TSPSD (BJ) · BWSN water pollution, 10% noise | F-measure: 0.68 -> 0.91 | Helped |
| add optimizations of Section 3.4 (pruning, single DP call) (ablation) | TSPSD Steiner Tree · BWSN water pollution | run time (min): 2.89 -> 0.77 | Helped |
| TSPSD Steiner-T vs EventTree | subgraph detector · BWSN water pollution, 30% noise | F-measure: 0.17 -> 0.62 | Helped |
| TSPSD Steiner-T vs Graph-Laplacian at high noise | subgraph detector · BWSN water pollution, 30% noise | F-measure: 0.66 -> 0.62 | Hurt |
| TSPSD-Steiner HC vs NPHGS HC | haze event detection · Weibo haze outbreak, FPR 0.150/day | TPR (detection): 0.43 -> 0.62 | Helped |
| TSPSD-Steiner vs EventTree on lag time | haze event detection · Weibo haze outbreak, FPR 0.150/day | run time (min): 7.5 -> 18 | Hurt |
Closest papers by meaning
- Optimal community detection in dense bipartite graphs (NeurIPS 2025 · similarity 0.85)
- UniGAD: Unifying Multi-level Graph Anomaly Detection (NeurIPS 2024 · similarity 0.84)
- Leveraging Diffusion Model as Pseudo-Anomalous Graph Generator for Graph-Level Anomaly Detection (ICML 2025 · similarity 0.84)
- DiffGAD: A Diffusion-based Unsupervised Graph Anomaly Detector (ICLR 2025 · similarity 0.84)
- Unifying Unsupervised Graph-Level Anomaly Detection and Out-of-Distribution Detection: A Benchmark (ICLR 2025 · similarity 0.84)
- Graph Anomaly Detection as Dynamical Transport: Training-Free Scoring via Empirical Bayes (NeurIPS 2026 · similarity 0.83)
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.