Research map / Graph learning / Graph algorithms and clustering
Matched Filters for Noisy Induced Subgraph Detection
Daniel L. Sussman, Youngser Park, Carey E. Priebe, Vince Lyzinski
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 |
|---|---|---|---|
| add 15 seeds instead of 0 (rho=0.9) (ablation) | matched filter · Correlated Erdos-Renyi | runtime per restart (s): 1.9 -> 0.73 | Improved |
| add soft seeds (ablation) | matched filter · Correlated Erdos-Renyi, rho=1 | recovery of vertices | Improved |
| add a rank-2 second match after rank-1 first match (ablation) | matched filter · Drosophila K-cells, 0 seeds | K-cells detected: 86 -> 89 | Improved |
| add a rank-4 second match after rank-1 first match (ablation) | matched filter · Drosophila K-cells, 10 seeds | K-cells detected: 84 -> 89 | Improved |
| add a rank-1 second match after centered first match (ablation) | matched filter · Drosophila K-cells, 0 seeds | K-cells detected: 77 -> 86 | Improved |
| add a rank-1 second match after rank-2 first match (ablation) | matched filter · Drosophila K-cells, 10 seeds | K-cells detected: 76 -> 84 | Improved |
| add 10 seeds instead of 0 (ablation) | matched filter · Drosophila K-cells | K-cells detected: 89 -> 89 | No clear effect |
| use rank-1 centering instead of constant centering (ablation) | matched filter · random dot product graph | matching accuracy | Hurt |
| use rank-2 instead of rank-1 centering (ablation) | matched filter · random dot product graph | matching accuracy | Improved |
| use max-angle instead of random subgraph sampling (ablation) | matched filter · random dot product graph | matching accuracy | Improved |
| increase subgraph density q from 0.25 to 0.5 (ablation) | matched filter · planted partition Erdos-Renyi | matched vertices | Improved |
Closest papers by meaning
- Iteratively Refined Early Interaction Alignment for Subgraph Matching based Graph Retrieval (NeurIPS 2024 · similarity 0.87)
- Towards Optimizing Large-Scale Multi-Graph Matching in Bioimaging (CVPR 2025 · similarity 0.86)
- Editing Partially Observable Networks via Graph Diffusion Models (ICML 2024 · similarity 0.86)
- A Flexible, Equivariant Framework for Subgraph GNNs via Graph Products and Graph Coarsening (NeurIPS 2024 · similarity 0.85)
- Aligning Embeddings and Geometric Random Graphs: Informational Results and Computational Approaches for the Procrustes-Wasserstein Problem (NeurIPS 2024 · similarity 0.85)
- Efficient Graph Matching for Correlated Stochastic Block Models (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.
